./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:14:13,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:14:13,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:14:13,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:14:13,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:14:13,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:14:13,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:14:13,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:14:13,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:14:13,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:14:13,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:14:13,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:14:13,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:14:13,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:14:13,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:14:14,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:14:14,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:14:14,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:14:14,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:14:14,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:14:14,011 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:14:14,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:14:14,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:14:14,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:14:14,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:14:14,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:14:14,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:14:14,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:14:14,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:14:14,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:14:14,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:14:14,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:14:14,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:14:14,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:14:14,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:14:14,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:14:14,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:14:14,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:14:14,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:14:14,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:14:14,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:14:14,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:14:14,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:14:14,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:14:14,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:14:14,057 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:14:14,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:14:14,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:14:14,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:14:14,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:14:14,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:14:14,058 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:14:14,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:14:14,059 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:14:14,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:14:14,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:14:14,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:14:14,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:14:14,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:14:14,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:14:14,060 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:14:14,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:14:14,061 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:14:14,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:14:14,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:14:14,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:14:14,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:14:14,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:14:14,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:14:14,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:14:14,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:14:14,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:14:14,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:14:14,062 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:14:14,063 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:14:14,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:14:14,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2022-07-21 02:14:14,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:14:14,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:14:14,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:14:14,375 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:14:14,375 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:14:14,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-07-21 02:14:14,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4317c0d1b/f596077705264d199cbea561bce10c2a/FLAGcb064b83a [2022-07-21 02:14:14,890 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:14:14,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-07-21 02:14:14,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4317c0d1b/f596077705264d199cbea561bce10c2a/FLAGcb064b83a [2022-07-21 02:14:14,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4317c0d1b/f596077705264d199cbea561bce10c2a [2022-07-21 02:14:14,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:14:14,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:14:14,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:14:14,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:14:14,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:14:14,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:14:14" (1/1) ... [2022-07-21 02:14:14,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d46be70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:14, skipping insertion in model container [2022-07-21 02:14:14,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:14:14" (1/1) ... [2022-07-21 02:14:14,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:14:14,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:14:15,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-07-21 02:14:15,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:14:15,233 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:14:15,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-07-21 02:14:15,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:14:15,293 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:14:15,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:15 WrapperNode [2022-07-21 02:14:15,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:14:15,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:14:15,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:14:15,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:14:15,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:15" (1/1) ... [2022-07-21 02:14:15,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:15" (1/1) ... [2022-07-21 02:14:15,326 INFO L137 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2022-07-21 02:14:15,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:14:15,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:14:15,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:14:15,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:14:15,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:15" (1/1) ... [2022-07-21 02:14:15,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:15" (1/1) ... [2022-07-21 02:14:15,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:15" (1/1) ... [2022-07-21 02:14:15,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:15" (1/1) ... [2022-07-21 02:14:15,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:15" (1/1) ... [2022-07-21 02:14:15,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:15" (1/1) ... [2022-07-21 02:14:15,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:15" (1/1) ... [2022-07-21 02:14:15,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:14:15,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:14:15,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:14:15,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:14:15,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:15" (1/1) ... [2022-07-21 02:14:15,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:14:15,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:14:15,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 02:14:15,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 02:14:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:14:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:14:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 02:14:15,477 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 02:14:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:14:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:14:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 02:14:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:14:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:14:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:14:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 02:14:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:14:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:14:15,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:14:15,569 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:14:15,571 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:14:15,787 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:14:15,793 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:14:15,793 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 02:14:15,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:14:15 BoogieIcfgContainer [2022-07-21 02:14:15,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:14:15,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:14:15,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:14:15,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:14:15,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:14:14" (1/3) ... [2022-07-21 02:14:15,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638f00b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:14:15, skipping insertion in model container [2022-07-21 02:14:15,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:15" (2/3) ... [2022-07-21 02:14:15,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638f00b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:14:15, skipping insertion in model container [2022-07-21 02:14:15,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:14:15" (3/3) ... [2022-07-21 02:14:15,800 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2022-07-21 02:14:15,809 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:14:15,810 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:14:15,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:14:15,854 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@477c007a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3dce905f [2022-07-21 02:14:15,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:14:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:14:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 02:14:15,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:15,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:14:15,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:15,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash -346371136, now seen corresponding path program 1 times [2022-07-21 02:14:15,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:15,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782779160] [2022-07-21 02:14:15,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:15,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:16,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 02:14:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:14:16,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:16,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782779160] [2022-07-21 02:14:16,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782779160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:16,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:16,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:14:16,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241507771] [2022-07-21 02:14:16,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:16,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:14:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:16,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:14:16,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:14:16,118 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 02:14:16,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:16,179 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2022-07-21 02:14:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:14:16,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-21 02:14:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:16,185 INFO L225 Difference]: With dead ends: 65 [2022-07-21 02:14:16,185 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 02:14:16,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:14:16,190 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:16,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:16,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 02:14:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-21 02:14:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:14:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-07-21 02:14:16,219 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-07-21 02:14:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:16,219 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-21 02:14:16,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 02:14:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-07-21 02:14:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 02:14:16,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:16,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:14:16,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:14:16,223 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1530291827, now seen corresponding path program 1 times [2022-07-21 02:14:16,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:16,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339423685] [2022-07-21 02:14:16,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:16,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:16,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 02:14:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:14:16,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:16,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339423685] [2022-07-21 02:14:16,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339423685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:16,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:16,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:14:16,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188479300] [2022-07-21 02:14:16,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:16,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:14:16,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:16,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:14:16,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:14:16,339 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 02:14:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:16,373 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-07-21 02:14:16,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:14:16,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-21 02:14:16,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:16,375 INFO L225 Difference]: With dead ends: 58 [2022-07-21 02:14:16,375 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 02:14:16,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:14:16,376 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:16,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 02:14:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-21 02:14:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:14:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-21 02:14:16,382 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2022-07-21 02:14:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:16,382 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-21 02:14:16,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 02:14:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-21 02:14:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 02:14:16,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:16,383 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:14:16,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 02:14:16,384 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 878865159, now seen corresponding path program 1 times [2022-07-21 02:14:16,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:16,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955277021] [2022-07-21 02:14:16,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:16,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:16,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:14:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:16,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 02:14:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:14:16,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:16,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955277021] [2022-07-21 02:14:16,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955277021] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:16,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:16,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:14:16,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607520418] [2022-07-21 02:14:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:16,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:14:16,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:16,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:14:16,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:14:16,506 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:14:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:16,540 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2022-07-21 02:14:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:14:16,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-21 02:14:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:16,541 INFO L225 Difference]: With dead ends: 63 [2022-07-21 02:14:16,541 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 02:14:16,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:14:16,542 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:16,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:16,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 02:14:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-07-21 02:14:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:14:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-07-21 02:14:16,547 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 27 [2022-07-21 02:14:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:16,547 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-21 02:14:16,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:14:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-07-21 02:14:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 02:14:16,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:16,549 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:14:16,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 02:14:16,549 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:16,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:16,549 INFO L85 PathProgramCache]: Analyzing trace with hash -709482743, now seen corresponding path program 1 times [2022-07-21 02:14:16,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:16,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896300384] [2022-07-21 02:14:16,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:16,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:16,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:14:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:16,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 02:14:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:14:16,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:16,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896300384] [2022-07-21 02:14:16,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896300384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:16,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246962008] [2022-07-21 02:14:16,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:16,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:16,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:14:16,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:14:16,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 02:14:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:16,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:14:16,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:14:16,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:14:16,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246962008] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:14:16,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:14:16,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-07-21 02:14:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422090418] [2022-07-21 02:14:16,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:16,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:14:16,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:16,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:14:16,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:14:16,871 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 02:14:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:16,916 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-07-21 02:14:16,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 02:14:16,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2022-07-21 02:14:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:16,917 INFO L225 Difference]: With dead ends: 59 [2022-07-21 02:14:16,917 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 02:14:16,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:14:16,921 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:16,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 02:14:16,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-21 02:14:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:14:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-07-21 02:14:16,929 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2022-07-21 02:14:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:16,929 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-07-21 02:14:16,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 02:14:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-07-21 02:14:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 02:14:16,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:16,930 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:14:16,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 02:14:17,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:17,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:17,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:17,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1607276515, now seen corresponding path program 1 times [2022-07-21 02:14:17,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:17,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823180536] [2022-07-21 02:14:17,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:17,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:17,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:14:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:17,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 02:14:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:17,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 02:14:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:14:17,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:17,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823180536] [2022-07-21 02:14:17,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823180536] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:17,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197132334] [2022-07-21 02:14:17,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:17,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:17,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:14:17,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:14:17,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 02:14:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:17,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-21 02:14:17,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:17,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:14:17,788 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_520 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_520) |c_#memory_$Pointer$.base|)))) is different from true [2022-07-21 02:14:17,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:17,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-21 02:14:17,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 02:14:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-21 02:14:17,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:17,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array Int Int)) (|v_node_create_~temp~0#1.base_13| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_13| v_ArrVal_523) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (<= 1 .cse0) (not (< |v_node_create_~temp~0#1.base_13| |c_#StackHeapBarrier|))))) is different from false [2022-07-21 02:14:17,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197132334] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:17,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:14:17,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-07-21 02:14:17,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499064181] [2022-07-21 02:14:17,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:17,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-21 02:14:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:17,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-21 02:14:17,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=525, Unknown=2, NotChecked=94, Total=702 [2022-07-21 02:14:17,957 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 02:14:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:18,225 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-07-21 02:14:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 02:14:18,226 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2022-07-21 02:14:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:18,229 INFO L225 Difference]: With dead ends: 46 [2022-07-21 02:14:18,229 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 02:14:18,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=856, Unknown=2, NotChecked=122, Total=1122 [2022-07-21 02:14:18,230 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:18,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 192 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 147 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2022-07-21 02:14:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 02:14:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-21 02:14:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:14:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-21 02:14:18,240 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 37 [2022-07-21 02:14:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:18,240 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-21 02:14:18,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 02:14:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-21 02:14:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 02:14:18,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:18,242 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:14:18,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 02:14:18,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:18,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:18,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash -859241559, now seen corresponding path program 1 times [2022-07-21 02:14:18,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:18,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096233936] [2022-07-21 02:14:18,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:18,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:14:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:18,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 02:14:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 02:14:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:14:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:19,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096233936] [2022-07-21 02:14:19,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096233936] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:19,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408608065] [2022-07-21 02:14:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:19,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:19,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:14:19,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:14:19,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 02:14:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:19,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-21 02:14:19,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:19,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:14:19,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:14:19,362 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:14:19,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 02:14:19,475 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:14:19,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:14:19,577 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-21 02:14:19,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-07-21 02:14:19,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:14:19,694 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:14:19,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-21 02:14:19,935 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-21 02:14:19,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 30 [2022-07-21 02:14:19,950 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:14:19,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-07-21 02:14:20,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:20,111 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:14:20,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 79 [2022-07-21 02:14:20,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:20,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2022-07-21 02:14:20,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:20,130 INFO L356 Elim1Store]: treesize reduction 30, result has 47.4 percent of original size [2022-07-21 02:14:20,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 39 [2022-07-21 02:14:20,393 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-21 02:14:20,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 69 [2022-07-21 02:14:20,421 INFO L356 Elim1Store]: treesize reduction 126, result has 14.3 percent of original size [2022-07-21 02:14:20,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 66 [2022-07-21 02:14:20,442 INFO L356 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-07-21 02:14:20,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 120 [2022-07-21 02:14:20,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:20,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 71 [2022-07-21 02:14:20,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-07-21 02:14:20,508 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-21 02:14:20,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 23 [2022-07-21 02:14:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:14:20,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:23,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408608065] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:23,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:14:23,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 46 [2022-07-21 02:14:23,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5812936] [2022-07-21 02:14:23,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:23,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-21 02:14:23,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:23,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-21 02:14:23,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2451, Unknown=15, NotChecked=0, Total=2652 [2022-07-21 02:14:23,029 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 38 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:14:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:24,352 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-07-21 02:14:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 02:14:24,353 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 38 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2022-07-21 02:14:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:24,355 INFO L225 Difference]: With dead ends: 67 [2022-07-21 02:14:24,355 INFO L226 Difference]: Without dead ends: 39 [2022-07-21 02:14:24,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=356, Invalid=4051, Unknown=15, NotChecked=0, Total=4422 [2022-07-21 02:14:24,357 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:24,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 424 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 679 Invalid, 0 Unknown, 10 Unchecked, 0.4s Time] [2022-07-21 02:14:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-21 02:14:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-07-21 02:14:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:14:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-07-21 02:14:24,361 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 40 [2022-07-21 02:14:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:24,361 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-07-21 02:14:24,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 38 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:14:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-07-21 02:14:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 02:14:24,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:24,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:14:24,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 02:14:24,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:24,563 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:24,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1146227584, now seen corresponding path program 1 times [2022-07-21 02:14:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:24,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920073108] [2022-07-21 02:14:24,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:24,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:25,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:14:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:25,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 02:14:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:25,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 02:14:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:14:25,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:25,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920073108] [2022-07-21 02:14:25,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920073108] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:25,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719861757] [2022-07-21 02:14:25,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:25,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:25,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:14:25,963 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:14:25,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 02:14:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:26,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 143 conjunts are in the unsatisfiable core [2022-07-21 02:14:26,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:26,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:14:26,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:14:26,915 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:14:26,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 02:14:26,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:14:26,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:26,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 02:14:27,069 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:14:27,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 52 [2022-07-21 02:14:27,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 02:14:27,407 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:14:27,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 35 [2022-07-21 02:14:27,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:14:27,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:14:27,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:14:27,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:27,638 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:14:27,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 72 [2022-07-21 02:14:27,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:27,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 02:14:27,659 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 02:14:27,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-07-21 02:14:27,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:27,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:14:28,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:14:28,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:28,470 INFO L356 Elim1Store]: treesize reduction 153, result has 15.5 percent of original size [2022-07-21 02:14:28,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 212 treesize of output 110 [2022-07-21 02:14:28,497 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-21 02:14:28,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 167 [2022-07-21 02:14:28,510 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-21 02:14:28,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 163 [2022-07-21 02:14:28,529 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-21 02:14:28,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 182 [2022-07-21 02:14:28,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:28,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:28,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2022-07-21 02:14:28,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:14:28,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:28,709 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-07-21 02:14:28,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 60 [2022-07-21 02:14:28,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:28,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-07-21 02:14:28,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:14:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:14:28,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:29,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_10| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_10| 4))) (or (not (= (select .cse0 .cse1) 0)) (= (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_1036) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1038) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1031) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2022-07-21 02:14:29,314 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_10| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_10| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1036) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1038) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1031) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-07-21 02:14:29,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_10| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_10| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1036) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1038) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1031) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-07-21 02:14:29,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_10| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1031 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1052)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1051))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_10| 4))) (or (= (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1053) .cse0 v_ArrVal_1036) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1038) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1031) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse0 (store (select .cse4 .cse0) .cse3 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1033) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| |c_#StackHeapBarrier|)) (not (= (select .cse2 .cse3) 0))))))) is different from false [2022-07-21 02:14:29,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719861757] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:29,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:14:29,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 54 [2022-07-21 02:14:29,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765344032] [2022-07-21 02:14:29,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:29,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-21 02:14:29,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:29,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-21 02:14:29,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2970, Unknown=53, NotChecked=452, Total=3660 [2022-07-21 02:14:29,426 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 45 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:14:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:32,015 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-07-21 02:14:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 02:14:32,016 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 45 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-07-21 02:14:32,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:32,019 INFO L225 Difference]: With dead ends: 54 [2022-07-21 02:14:32,019 INFO L226 Difference]: Without dead ends: 52 [2022-07-21 02:14:32,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1291 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=390, Invalid=5270, Unknown=56, NotChecked=604, Total=6320 [2022-07-21 02:14:32,025 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 56 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:32,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 452 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 961 Invalid, 0 Unknown, 61 Unchecked, 0.8s Time] [2022-07-21 02:14:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-21 02:14:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-07-21 02:14:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:14:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-07-21 02:14:32,040 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 44 [2022-07-21 02:14:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:32,042 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-07-21 02:14:32,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 45 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:14:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-07-21 02:14:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 02:14:32,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:32,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:14:32,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-21 02:14:32,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:32,270 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:32,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1173262244, now seen corresponding path program 1 times [2022-07-21 02:14:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:32,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851470324] [2022-07-21 02:14:32,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:32,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:32,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:14:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:32,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 02:14:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:32,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 02:14:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 02:14:32,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:32,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851470324] [2022-07-21 02:14:32,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851470324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:32,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:32,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 02:14:32,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531950691] [2022-07-21 02:14:32,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:32,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:14:32,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:14:32,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:14:32,390 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 02:14:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:32,456 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-07-21 02:14:32,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:14:32,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-21 02:14:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:32,460 INFO L225 Difference]: With dead ends: 56 [2022-07-21 02:14:32,460 INFO L226 Difference]: Without dead ends: 51 [2022-07-21 02:14:32,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:14:32,461 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:32,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-21 02:14:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2022-07-21 02:14:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:14:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-07-21 02:14:32,476 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 45 [2022-07-21 02:14:32,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:32,477 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-07-21 02:14:32,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 02:14:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-07-21 02:14:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 02:14:32,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:32,483 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:14:32,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 02:14:32,484 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:32,484 INFO L85 PathProgramCache]: Analyzing trace with hash -731397669, now seen corresponding path program 2 times [2022-07-21 02:14:32,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:32,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905544734] [2022-07-21 02:14:32,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:32,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:33,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:14:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:33,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 02:14:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:33,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 02:14:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:14:33,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:33,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905544734] [2022-07-21 02:14:33,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905544734] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:33,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914126180] [2022-07-21 02:14:33,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:14:33,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:33,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:14:33,449 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:14:33,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 02:14:33,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:14:33,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:14:33,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-21 02:14:33,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:33,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:14:33,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:14:33,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:14:34,186 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:14:34,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 02:14:34,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:14:34,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:14:34,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-21 02:14:34,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:14:34,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-21 02:14:34,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:14:34,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:34,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 02:14:34,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:34,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:34,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:14:34,446 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:14:34,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 91 [2022-07-21 02:14:34,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:34,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 02:14:34,472 INFO L356 Elim1Store]: treesize reduction 84, result has 21.5 percent of original size [2022-07-21 02:14:34,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 70 [2022-07-21 02:14:34,806 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-07-21 02:14:34,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 71 [2022-07-21 02:14:34,816 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 02:14:34,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 18 [2022-07-21 02:14:34,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:35,013 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:14:35,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 108 [2022-07-21 02:14:35,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:35,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 02:14:35,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:35,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:35,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:35,035 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-21 02:14:35,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 76 [2022-07-21 02:14:35,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:35,052 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 02:14:35,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-07-21 02:14:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:14:35,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:36,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1484 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| Int) (v_ArrVal_1482 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_14| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| v_ArrVal_1482)) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| v_ArrVal_1483))) (let ((.cse7 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select .cse3 .cse7) .cse8)) (.cse6 (+ (select (select .cse4 .cse7) .cse8) 4))) (let ((.cse2 (select (select .cse3 .cse5) .cse6))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_14| 4))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19|) 0)) (not (= 0 (select .cse0 .cse1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| v_ArrVal_1484) .cse2 v_ArrVal_1463) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| v_ArrVal_1464) (select (select (store (store .cse3 .cse2 (store .cse0 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| v_ArrVal_1465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse2 (store (select .cse4 .cse2) .cse1 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_19| v_ArrVal_1466) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= .cse2 0) (= (select (select .cse4 .cse5) .cse6) 0))))))))) is different from false [2022-07-21 02:14:36,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914126180] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:36,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:14:36,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 45 [2022-07-21 02:14:36,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093310122] [2022-07-21 02:14:36,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:36,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-21 02:14:36,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:36,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-21 02:14:36,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2847, Unknown=45, NotChecked=108, Total=3192 [2022-07-21 02:14:36,858 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 45 states, 43 states have (on average 1.558139534883721) internal successors, (67), 37 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:14:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:38,173 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-07-21 02:14:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 02:14:38,174 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.558139534883721) internal successors, (67), 37 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-07-21 02:14:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:38,176 INFO L225 Difference]: With dead ends: 79 [2022-07-21 02:14:38,176 INFO L226 Difference]: Without dead ends: 64 [2022-07-21 02:14:38,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=316, Invalid=4194, Unknown=50, NotChecked=132, Total=4692 [2022-07-21 02:14:38,178 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:38,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 391 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 648 Invalid, 0 Unknown, 68 Unchecked, 0.5s Time] [2022-07-21 02:14:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-21 02:14:38,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-07-21 02:14:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:14:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-21 02:14:38,193 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 46 [2022-07-21 02:14:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:38,193 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-21 02:14:38,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.558139534883721) internal successors, (67), 37 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:14:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-07-21 02:14:38,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 02:14:38,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:38,195 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:14:38,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:38,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:38,409 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:38,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:38,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2018358036, now seen corresponding path program 1 times [2022-07-21 02:14:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:38,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903357361] [2022-07-21 02:14:38,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:38,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:39,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:14:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 02:14:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:39,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 02:14:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:14:39,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:39,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903357361] [2022-07-21 02:14:39,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903357361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:39,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640130485] [2022-07-21 02:14:39,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:39,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:39,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:14:39,592 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:14:39,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 02:14:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:39,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 161 conjunts are in the unsatisfiable core [2022-07-21 02:14:39,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:39,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:14:39,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:14:39,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:14:39,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:39,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 02:14:40,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:14:40,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:14:40,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:14:40,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:14:40,298 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:14:40,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 02:14:40,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:14:40,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:14:40,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:14:40,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:14:40,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-21 02:14:40,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:14:40,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-21 02:14:40,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:14:40,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:40,507 INFO L356 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2022-07-21 02:14:40,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 106 [2022-07-21 02:14:40,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:40,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2022-07-21 02:14:40,520 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-21 02:14:40,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-21 02:14:40,895 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-21 02:14:40,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 65 [2022-07-21 02:14:40,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:40,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:40,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2022-07-21 02:14:40,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:14:40,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:14:41,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:41,167 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:14:41,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 191 treesize of output 159 [2022-07-21 02:14:41,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:41,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:41,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:41,198 INFO L356 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2022-07-21 02:14:41,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 162 [2022-07-21 02:14:41,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:41,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-21 02:14:41,229 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-07-21 02:14:41,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-21 02:14:41,829 INFO L356 Elim1Store]: treesize reduction 47, result has 48.9 percent of original size [2022-07-21 02:14:41,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 64 [2022-07-21 02:14:41,895 INFO L356 Elim1Store]: treesize reduction 190, result has 15.9 percent of original size [2022-07-21 02:14:41,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 130 [2022-07-21 02:14:41,933 INFO L356 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2022-07-21 02:14:41,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 298 treesize of output 254 [2022-07-21 02:14:41,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:41,975 INFO L356 Elim1Store]: treesize reduction 116, result has 22.7 percent of original size [2022-07-21 02:14:41,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 228 treesize of output 214 [2022-07-21 02:14:41,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:41,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:41,992 INFO L356 Elim1Store]: treesize reduction 43, result has 10.4 percent of original size [2022-07-21 02:14:41,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 231 [2022-07-21 02:14:42,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2022-07-21 02:14:42,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-07-21 02:14:43,457 INFO L356 Elim1Store]: treesize reduction 138, result has 2.1 percent of original size [2022-07-21 02:14:43,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 418 treesize of output 127 [2022-07-21 02:14:43,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:43,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:43,469 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-07-21 02:14:43,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 73 [2022-07-21 02:14:43,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-07-21 02:14:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 02:14:43,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:43,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1763 Int) (v_ArrVal_1755 Int) (v_ArrVal_1759 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5 v_ArrVal_1755)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1759)) (.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1758))) (let ((.cse6 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse3 .cse6) .cse7)) (.cse4 (select (select .cse0 .cse6) .cse7))) (or (let ((.cse2 (+ .cse4 4))) (and (= 0 (select (select .cse0 .cse1) .cse2)) (= (select (select .cse3 .cse1) .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5 v_ArrVal_1763)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1757) .cse1) .cse4)))))))) is different from false [2022-07-21 02:14:44,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1763 Int) (v_ArrVal_1755 Int) (v_ArrVal_1759 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse0 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1755)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1759)) (.cse4 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse3 .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1758))) (let ((.cse7 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse1 (select (select .cse4 .cse7) .cse8)) (.cse2 (select (select .cse6 .cse7) .cse8))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1763)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1757) .cse1) .cse2)) (not (= (select .cse3 .cse0) 0)) (let ((.cse5 (+ 4 .cse2))) (and (= (select (select .cse4 .cse1) .cse5) 0) (= (select (select .cse6 .cse1) .cse5) 0))))))))) is different from false [2022-07-21 02:14:45,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| Int) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (v_ArrVal_1774 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1763 Int) (v_ArrVal_1755 Int) (v_ArrVal_1759 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1774))) (let ((.cse7 (select .cse10 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse1 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse6 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1772))) (store .cse11 |ULTIMATE.start_dll_append_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_1755))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1759)) (.cse4 (store (store .cse10 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse7 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1758))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse4 .cse8) .cse9)) (.cse3 (select (select .cse6 .cse8) .cse9))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1773))) (store .cse0 |ULTIMATE.start_dll_append_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_1763))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1757) .cse2) .cse3)) (let ((.cse5 (+ .cse3 4))) (and (= (select (select .cse4 .cse2) .cse5) 0) (= (select (select .cse6 .cse2) .cse5) 0))) (not (= (select .cse7 .cse1) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22|) 0))))))))) is different from false [2022-07-21 02:14:45,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640130485] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:45,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:14:45,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2022-07-21 02:14:45,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584146678] [2022-07-21 02:14:45,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:45,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-21 02:14:45,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:45,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-21 02:14:45,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3373, Unknown=3, NotChecked=354, Total=3906 [2022-07-21 02:14:45,384 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 54 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 46 states have internal predecessors, (80), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:14:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:51,955 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-07-21 02:14:51,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 02:14:51,956 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 46 states have internal predecessors, (80), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-07-21 02:14:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:51,956 INFO L225 Difference]: With dead ends: 79 [2022-07-21 02:14:51,956 INFO L226 Difference]: Without dead ends: 77 [2022-07-21 02:14:51,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=370, Invalid=6445, Unknown=3, NotChecked=492, Total=7310 [2022-07-21 02:14:51,958 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:51,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 484 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1171 Invalid, 0 Unknown, 194 Unchecked, 0.8s Time] [2022-07-21 02:14:51,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-21 02:14:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-07-21 02:14:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.126984126984127) internal successors, (71), 63 states have internal predecessors, (71), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:14:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2022-07-21 02:14:51,972 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 47 [2022-07-21 02:14:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:51,972 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2022-07-21 02:14:51,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 46 states have internal predecessors, (80), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:14:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2022-07-21 02:14:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 02:14:51,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:51,974 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:14:51,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:52,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:52,194 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:52,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1855355832, now seen corresponding path program 1 times [2022-07-21 02:14:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:52,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203376274] [2022-07-21 02:14:52,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:53,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:14:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:53,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 02:14:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:53,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 02:14:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:14:53,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:53,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203376274] [2022-07-21 02:14:53,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203376274] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:53,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439682462] [2022-07-21 02:14:53,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:53,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:53,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:14:53,716 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:14:53,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 02:14:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:54,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 171 conjunts are in the unsatisfiable core [2022-07-21 02:14:54,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:54,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:14:54,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:14:54,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:54,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 02:14:54,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:54,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:14:54,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:54,731 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-21 02:14:54,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-21 02:14:54,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:14:54,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:14:54,969 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:14:54,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 60 [2022-07-21 02:14:54,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 02:14:55,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:14:55,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 40 [2022-07-21 02:14:55,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:14:55,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:55,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-21 02:14:55,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:14:55,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:55,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:55,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 02:14:55,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:55,530 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:14:55,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 77 [2022-07-21 02:14:55,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:55,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:55,545 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 02:14:55,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 43 [2022-07-21 02:14:56,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:56,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:14:56,229 INFO L356 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2022-07-21 02:14:56,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 271 treesize of output 136 [2022-07-21 02:14:56,268 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-21 02:14:56,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 522 treesize of output 341 [2022-07-21 02:14:56,304 INFO L356 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2022-07-21 02:14:56,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 473 treesize of output 304 [2022-07-21 02:14:56,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:56,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 49 [2022-07-21 02:14:56,350 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-21 02:14:56,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 166 [2022-07-21 02:14:56,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2022-07-21 02:14:56,729 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 02:14:56,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 137 [2022-07-21 02:14:56,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:14:56,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:56,849 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-21 02:14:56,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 61 [2022-07-21 02:14:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:14:56,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:58,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:14:58,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 639 treesize of output 632 [2022-07-21 02:14:58,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:14:58,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10216 treesize of output 9652 [2022-07-21 02:14:58,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10492 treesize of output 9092 [2022-07-21 02:14:59,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 3 [2022-07-21 02:14:59,592 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:14:59,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1446 treesize of output 1450 [2022-07-21 02:15:01,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439682462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:15:01,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:15:01,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 57 [2022-07-21 02:15:01,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372756238] [2022-07-21 02:15:01,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:15:01,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-21 02:15:01,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:15:01,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-21 02:15:01,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=4333, Unknown=2, NotChecked=0, Total=4556 [2022-07-21 02:15:01,787 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 57 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 48 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:15:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:15:03,937 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-07-21 02:15:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 02:15:03,938 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 48 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2022-07-21 02:15:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:15:03,939 INFO L225 Difference]: With dead ends: 78 [2022-07-21 02:15:03,940 INFO L226 Difference]: Without dead ends: 73 [2022-07-21 02:15:03,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1403 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=421, Invalid=6549, Unknown=2, NotChecked=0, Total=6972 [2022-07-21 02:15:03,948 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 48 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 02:15:03,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 500 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 871 Invalid, 0 Unknown, 35 Unchecked, 0.6s Time] [2022-07-21 02:15:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-21 02:15:03,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-07-21 02:15:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:15:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-21 02:15:03,961 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 48 [2022-07-21 02:15:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:15:03,962 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-21 02:15:03,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 48 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:15:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-21 02:15:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 02:15:03,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:15:03,963 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:15:03,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 02:15:04,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:15:04,183 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:15:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:15:04,184 INFO L85 PathProgramCache]: Analyzing trace with hash 638551040, now seen corresponding path program 2 times [2022-07-21 02:15:04,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:15:04,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970923225] [2022-07-21 02:15:04,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:15:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:15:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:05,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 02:15:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:05,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 02:15:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:05,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 02:15:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:05,428 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:15:05,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:15:05,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970923225] [2022-07-21 02:15:05,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970923225] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:15:05,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253777700] [2022-07-21 02:15:05,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:15:05,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:15:05,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:15:05,430 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:15:05,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 02:15:05,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:15:05,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:15:05,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 189 conjunts are in the unsatisfiable core [2022-07-21 02:15:05,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:15:05,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:15:05,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:15:05,836 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 02:15:05,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 02:15:06,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 02:15:06,037 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 675739 column 46: unknown constant v_old(#valid)_AFTER_CALL_21 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 02:15:06,039 INFO L158 Benchmark]: Toolchain (without parser) took 51114.55ms. Allocated memory was 56.6MB in the beginning and 339.7MB in the end (delta: 283.1MB). Free memory was 32.6MB in the beginning and 141.7MB in the end (delta: -109.1MB). Peak memory consumption was 174.6MB. Max. memory is 16.1GB. [2022-07-21 02:15:06,039 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 38.2MB in the beginning and 38.2MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:15:06,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.88ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 32.4MB in the beginning and 51.1MB in the end (delta: -18.7MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-07-21 02:15:06,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.95ms. Allocated memory is still 75.5MB. Free memory was 50.9MB in the beginning and 48.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:15:06,040 INFO L158 Benchmark]: Boogie Preprocessor took 51.62ms. Allocated memory is still 75.5MB. Free memory was 48.8MB in the beginning and 47.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:15:06,040 INFO L158 Benchmark]: RCFGBuilder took 415.13ms. Allocated memory is still 75.5MB. Free memory was 46.9MB in the beginning and 47.9MB in the end (delta: -999.9kB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2022-07-21 02:15:06,040 INFO L158 Benchmark]: TraceAbstraction took 50242.68ms. Allocated memory was 75.5MB in the beginning and 339.7MB in the end (delta: 264.2MB). Free memory was 47.2MB in the beginning and 141.7MB in the end (delta: -94.4MB). Peak memory consumption was 170.0MB. Max. memory is 16.1GB. [2022-07-21 02:15:06,041 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 38.2MB in the beginning and 38.2MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.88ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 32.4MB in the beginning and 51.1MB in the end (delta: -18.7MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.95ms. Allocated memory is still 75.5MB. Free memory was 50.9MB in the beginning and 48.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.62ms. Allocated memory is still 75.5MB. Free memory was 48.8MB in the beginning and 47.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 415.13ms. Allocated memory is still 75.5MB. Free memory was 46.9MB in the beginning and 47.9MB in the end (delta: -999.9kB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * TraceAbstraction took 50242.68ms. Allocated memory was 75.5MB in the beginning and 339.7MB in the end (delta: 264.2MB). Free memory was 47.2MB in the beginning and 141.7MB in the end (delta: -94.4MB). Peak memory consumption was 170.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 675739 column 46: unknown constant v_old(#valid)_AFTER_CALL_21 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 675739 column 46: unknown constant v_old(#valid)_AFTER_CALL_21: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 02:15:06,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:15:07,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:15:07,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:15:07,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:15:07,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:15:07,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:15:07,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:15:07,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:15:07,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:15:07,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:15:07,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:15:07,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:15:07,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:15:07,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:15:07,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:15:07,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:15:07,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:15:07,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:15:07,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:15:07,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:15:07,841 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:15:07,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:15:07,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:15:07,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:15:07,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:15:07,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:15:07,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:15:07,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:15:07,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:15:07,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:15:07,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:15:07,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:15:07,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:15:07,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:15:07,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:15:07,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:15:07,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:15:07,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:15:07,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:15:07,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:15:07,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:15:07,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:15:07,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 02:15:07,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:15:07,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:15:07,902 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:15:07,902 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:15:07,903 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:15:07,903 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:15:07,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:15:07,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:15:07,904 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:15:07,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:15:07,904 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:15:07,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:15:07,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:15:07,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:15:07,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:15:07,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:15:07,905 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 02:15:07,905 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 02:15:07,905 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 02:15:07,905 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:15:07,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:15:07,905 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:15:07,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:15:07,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:15:07,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:15:07,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:15:07,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:15:07,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:15:07,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:15:07,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:15:07,906 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 02:15:07,906 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 02:15:07,906 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:15:07,906 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:15:07,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:15:07,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 02:15:07,907 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2022-07-21 02:15:08,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:15:08,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:15:08,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:15:08,200 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:15:08,202 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:15:08,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-07-21 02:15:08,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ecda482/cb32f14c4c644ef0b3a2807efa702ff7/FLAGf44b8215b [2022-07-21 02:15:08,665 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:15:08,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-07-21 02:15:08,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ecda482/cb32f14c4c644ef0b3a2807efa702ff7/FLAGf44b8215b [2022-07-21 02:15:08,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ecda482/cb32f14c4c644ef0b3a2807efa702ff7 [2022-07-21 02:15:08,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:15:08,689 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:15:08,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:15:08,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:15:08,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:15:08,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:15:08" (1/1) ... [2022-07-21 02:15:08,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d83eee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:15:08, skipping insertion in model container [2022-07-21 02:15:08,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:15:08" (1/1) ... [2022-07-21 02:15:08,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:15:08,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:15:09,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-07-21 02:15:09,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:15:09,014 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:15:09,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-07-21 02:15:09,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:15:09,090 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:15:09,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:15:09 WrapperNode [2022-07-21 02:15:09,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:15:09,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:15:09,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:15:09,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:15:09,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:15:09" (1/1) ... [2022-07-21 02:15:09,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:15:09" (1/1) ... [2022-07-21 02:15:09,130 INFO L137 Inliner]: procedures = 130, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2022-07-21 02:15:09,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:15:09,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:15:09,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:15:09,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:15:09,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:15:09" (1/1) ... [2022-07-21 02:15:09,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:15:09" (1/1) ... [2022-07-21 02:15:09,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:15:09" (1/1) ... [2022-07-21 02:15:09,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:15:09" (1/1) ... [2022-07-21 02:15:09,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:15:09" (1/1) ... [2022-07-21 02:15:09,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:15:09" (1/1) ... [2022-07-21 02:15:09,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:15:09" (1/1) ... [2022-07-21 02:15:09,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:15:09,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:15:09,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:15:09,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:15:09,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:15:09" (1/1) ... [2022-07-21 02:15:09,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:15:09,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:15:09,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 02:15:09,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 02:15:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 02:15:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 02:15:09,242 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 02:15:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:15:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:15:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 02:15:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:15:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:15:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:15:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 02:15:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 02:15:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 02:15:09,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:15:09,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:15:09,321 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:15:09,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:15:09,557 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:15:09,561 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:15:09,561 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 02:15:09,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:15:09 BoogieIcfgContainer [2022-07-21 02:15:09,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:15:09,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:15:09,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:15:09,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:15:09,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:15:08" (1/3) ... [2022-07-21 02:15:09,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eddd851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:15:09, skipping insertion in model container [2022-07-21 02:15:09,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:15:09" (2/3) ... [2022-07-21 02:15:09,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eddd851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:15:09, skipping insertion in model container [2022-07-21 02:15:09,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:15:09" (3/3) ... [2022-07-21 02:15:09,567 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2022-07-21 02:15:09,575 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:15:09,575 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:15:09,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:15:09,610 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ca33df, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1bc2b0fe [2022-07-21 02:15:09,610 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:15:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:15:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 02:15:09,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:15:09,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:15:09,619 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:15:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:15:09,623 INFO L85 PathProgramCache]: Analyzing trace with hash -346371136, now seen corresponding path program 1 times [2022-07-21 02:15:09,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:15:09,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398565024] [2022-07-21 02:15:09,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:15:09,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:15:09,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:15:09,635 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:15:09,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 02:15:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:09,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 02:15:09,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:15:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:15:09,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:15:09,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:15:09,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398565024] [2022-07-21 02:15:09,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398565024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:15:09,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:15:09,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 02:15:09,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331650217] [2022-07-21 02:15:09,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:15:09,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 02:15:09,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:15:09,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 02:15:09,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:15:09,775 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 02:15:09,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:15:09,792 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2022-07-21 02:15:09,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 02:15:09,794 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-21 02:15:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:15:09,797 INFO L225 Difference]: With dead ends: 65 [2022-07-21 02:15:09,797 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 02:15:09,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:15:09,803 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:15:09,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:15:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 02:15:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-21 02:15:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:15:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-07-21 02:15:09,832 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-07-21 02:15:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:15:09,833 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-21 02:15:09,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 02:15:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-07-21 02:15:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 02:15:09,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:15:09,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:15:09,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 02:15:10,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:15:10,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:15:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:15:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1530291827, now seen corresponding path program 1 times [2022-07-21 02:15:10,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:15:10,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025650898] [2022-07-21 02:15:10,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:15:10,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:15:10,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:15:10,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:15:10,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 02:15:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:10,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 02:15:10,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:15:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:15:10,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:15:10,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:15:10,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025650898] [2022-07-21 02:15:10,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025650898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:15:10,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:15:10,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:15:10,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656457129] [2022-07-21 02:15:10,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:15:10,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:15:10,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:15:10,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:15:10,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:15:10,172 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 02:15:10,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:15:10,191 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-07-21 02:15:10,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:15:10,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-21 02:15:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:15:10,195 INFO L225 Difference]: With dead ends: 58 [2022-07-21 02:15:10,196 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 02:15:10,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:15:10,198 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:15:10,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:15:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 02:15:10,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-21 02:15:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:15:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-21 02:15:10,207 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2022-07-21 02:15:10,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:15:10,207 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-21 02:15:10,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 02:15:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-21 02:15:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 02:15:10,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:15:10,209 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:15:10,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-21 02:15:10,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:15:10,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:15:10,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:15:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash 878865159, now seen corresponding path program 1 times [2022-07-21 02:15:10,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:15:10,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738883952] [2022-07-21 02:15:10,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:15:10,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:15:10,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:15:10,433 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:15:10,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 02:15:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:10,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 02:15:10,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:15:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:15:10,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:15:10,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:15:10,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738883952] [2022-07-21 02:15:10,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738883952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:15:10,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:15:10,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:15:10,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880976355] [2022-07-21 02:15:10,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:15:10,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:15:10,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:15:10,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:15:10,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:15:10,589 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:15:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:15:10,619 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2022-07-21 02:15:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:15:10,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-21 02:15:10,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:15:10,620 INFO L225 Difference]: With dead ends: 63 [2022-07-21 02:15:10,620 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 02:15:10,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:15:10,621 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:15:10,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:15:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 02:15:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-07-21 02:15:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:15:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-07-21 02:15:10,625 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 27 [2022-07-21 02:15:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:15:10,626 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-21 02:15:10,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:15:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-07-21 02:15:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 02:15:10,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:15:10,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:15:10,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 02:15:10,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:15:10,836 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:15:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:15:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash -709482743, now seen corresponding path program 1 times [2022-07-21 02:15:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:15:10,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222581084] [2022-07-21 02:15:10,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:15:10,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:15:10,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:15:10,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:15:10,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 02:15:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:10,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:15:10,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:15:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:15:10,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:15:10,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:15:10,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:15:10,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222581084] [2022-07-21 02:15:10,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222581084] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:15:10,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:15:10,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-21 02:15:10,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639169335] [2022-07-21 02:15:10,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:15:10,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:15:10,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:15:10,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:15:10,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:15:10,991 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 02:15:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:15:11,024 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-07-21 02:15:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 02:15:11,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2022-07-21 02:15:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:15:11,026 INFO L225 Difference]: With dead ends: 63 [2022-07-21 02:15:11,026 INFO L226 Difference]: Without dead ends: 40 [2022-07-21 02:15:11,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:15:11,027 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:15:11,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:15:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-21 02:15:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2022-07-21 02:15:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:15:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-07-21 02:15:11,032 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2022-07-21 02:15:11,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:15:11,032 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-07-21 02:15:11,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 02:15:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-07-21 02:15:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 02:15:11,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:15:11,034 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:15:11,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 02:15:11,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:15:11,243 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:15:11,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:15:11,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1607276515, now seen corresponding path program 1 times [2022-07-21 02:15:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:15:11,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611981976] [2022-07-21 02:15:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:15:11,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:15:11,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:15:11,245 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:15:11,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 02:15:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:11,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 02:15:11,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:15:11,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:15:11,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-21 02:15:11,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:11,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-21 02:15:11,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 02:15:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:15:11,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:15:11,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:15:11,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611981976] [2022-07-21 02:15:11,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611981976] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:15:11,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1013070828] [2022-07-21 02:15:11,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:15:11,881 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 02:15:11,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 02:15:11,883 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 02:15:11,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-07-21 02:15:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:12,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 02:15:12,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:15:12,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-21 02:15:12,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:12,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-21 02:15:12,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 02:15:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:15:12,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:15:12,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1013070828] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:15:12,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:15:12,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2022-07-21 02:15:12,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470519767] [2022-07-21 02:15:12,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:15:12,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 02:15:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:15:12,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 02:15:12,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=503, Unknown=7, NotChecked=0, Total=600 [2022-07-21 02:15:12,676 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 02:15:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:15:13,126 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-07-21 02:15:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 02:15:13,127 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2022-07-21 02:15:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:15:13,128 INFO L225 Difference]: With dead ends: 46 [2022-07-21 02:15:13,128 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 02:15:13,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=721, Unknown=9, NotChecked=0, Total=870 [2022-07-21 02:15:13,129 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:15:13,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 155 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 31 Unchecked, 0.3s Time] [2022-07-21 02:15:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 02:15:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-21 02:15:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:15:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-21 02:15:13,132 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 37 [2022-07-21 02:15:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:15:13,132 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-21 02:15:13,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 02:15:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-21 02:15:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 02:15:13,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:15:13,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:15:13,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-07-21 02:15:13,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 02:15:13,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:15:13,546 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:15:13,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:15:13,547 INFO L85 PathProgramCache]: Analyzing trace with hash -859241559, now seen corresponding path program 1 times [2022-07-21 02:15:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:15:13,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518725222] [2022-07-21 02:15:13,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:15:13,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:15:13,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:15:13,549 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:15:13,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 02:15:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:13,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-21 02:15:13,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:15:13,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:15:13,993 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:15:13,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2022-07-21 02:15:14,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:15:14,107 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:15:14,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-07-21 02:15:14,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-21 02:15:14,351 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-21 02:15:14,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 33 [2022-07-21 02:15:14,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:15:14,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:15:14,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:14,526 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:15:14,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 51 [2022-07-21 02:15:14,550 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 02:15:14,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-07-21 02:15:14,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:14,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:15:14,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:15:14,731 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-21 02:15:14,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-07-21 02:15:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:15:14,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:15:14,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:15:14,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518725222] [2022-07-21 02:15:14,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518725222] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:15:14,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [182779077] [2022-07-21 02:15:14,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:15:14,971 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 02:15:14,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 02:15:14,983 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 02:15:14,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-21 02:15:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:15,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-21 02:15:15,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:15:15,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:15:15,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:15:16,164 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:15:16,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-21 02:15:16,173 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-07-21 02:15:16,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-21 02:15:16,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-21 02:15:16,727 INFO L356 Elim1Store]: treesize reduction 55, result has 11.3 percent of original size [2022-07-21 02:15:16,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 57 [2022-07-21 02:15:16,768 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-21 02:15:16,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 101 [2022-07-21 02:15:16,786 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-21 02:15:16,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 85 [2022-07-21 02:15:16,809 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:15:16,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 77 [2022-07-21 02:15:16,943 INFO L356 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-07-21 02:15:16,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 33 [2022-07-21 02:15:16,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-21 02:15:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:15:17,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:15:17,164 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_541 (_ BitVec 32))) (not (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_539))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_541)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_542) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (_ bv0 32)))) is different from false [2022-07-21 02:15:17,683 INFO L356 Elim1Store]: treesize reduction 19, result has 64.8 percent of original size [2022-07-21 02:15:17,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 118 [2022-07-21 02:15:17,710 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:15:17,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 148 [2022-07-21 02:15:17,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 114 [2022-07-21 02:15:18,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse0) v_arrayElimIndex_11) (_ bv0 32))) (let ((.cse3 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (and (or (forall ((v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse1 (store (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) v_arrayElimIndex_11 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_539))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) v_arrayElimCell_39))))) .cse3) (or (forall ((v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32))) (not (= (select (let ((.cse4 (store (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) v_arrayElimIndex_11 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_539))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) v_arrayElimCell_41)) (_ bv0 32)))) (not .cse3)))) (and (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) (not (= (bvadd (_ bv4294967292 32) v_arrayElimIndex_11) v_arrayElimCell_39)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (not (= |c_ULTIMATE.start_dll_append_~head#1.offset| v_arrayElimIndex_11)) (not (= .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|))))))) is different from false [2022-07-21 02:15:18,320 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimIndex_11 (_ BitVec 32)) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse0) v_arrayElimIndex_11) (_ bv0 32))) (let ((.cse3 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) (and (or (forall ((v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse1 (store (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) v_arrayElimIndex_11 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_539))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) v_arrayElimCell_39)) (_ bv0 32)))) .cse3) (or (not .cse3) (forall ((v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_41 (_ BitVec 32))) (not (= (select (let ((.cse4 (store (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) v_arrayElimIndex_11 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_539))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) v_arrayElimCell_41)) (_ bv0 32))))))) (and (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) (not (= (bvadd (_ bv4294967292 32) v_arrayElimIndex_11) v_arrayElimCell_39)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (not (= |c_ULTIMATE.start_dll_append_~head#1.offset| v_arrayElimIndex_11)) (not (= .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|))))))) is different from false [2022-07-21 02:15:20,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [182779077] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:15:20,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:15:20,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 42 [2022-07-21 02:15:20,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102396522] [2022-07-21 02:15:20,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:15:20,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-21 02:15:20,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:15:20,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-21 02:15:20,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2265, Unknown=19, NotChecked=294, Total=2756 [2022-07-21 02:15:20,368 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 42 states, 40 states have (on average 1.6) internal successors, (64), 35 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 02:15:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:15:22,762 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-07-21 02:15:22,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 02:15:22,763 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.6) internal successors, (64), 35 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2022-07-21 02:15:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:15:22,765 INFO L225 Difference]: With dead ends: 67 [2022-07-21 02:15:22,765 INFO L226 Difference]: Without dead ends: 39 [2022-07-21 02:15:22,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=326, Invalid=3698, Unknown=20, NotChecked=378, Total=4422 [2022-07-21 02:15:22,767 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 02:15:22,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 408 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 259 Invalid, 0 Unknown, 190 Unchecked, 0.8s Time] [2022-07-21 02:15:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-21 02:15:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-07-21 02:15:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:15:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-07-21 02:15:22,771 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 40 [2022-07-21 02:15:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:15:22,772 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-07-21 02:15:22,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.6) internal successors, (64), 35 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 02:15:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-07-21 02:15:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 02:15:22,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:15:22,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:15:22,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-07-21 02:15:22,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-21 02:15:23,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:15:23,180 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:15:23,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:15:23,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1563025532, now seen corresponding path program 1 times [2022-07-21 02:15:23,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:15:23,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349461536] [2022-07-21 02:15:23,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:15:23,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:15:23,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:15:23,182 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:15:23,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 02:15:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:23,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-21 02:15:23,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:15:23,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:15:23,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:15:23,624 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:15:23,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 02:15:23,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:15:23,866 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-21 02:15:23,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-21 02:15:23,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:15:24,013 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:15:24,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 52 [2022-07-21 02:15:24,361 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 02:15:24,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 31 [2022-07-21 02:15:24,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:15:24,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-21 02:15:24,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:24,534 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:15:24,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 62 [2022-07-21 02:15:24,559 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-21 02:15:24,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 40 [2022-07-21 02:15:24,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:15:25,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:25,183 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-21 02:15:25,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 92 [2022-07-21 02:15:25,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:25,218 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-21 02:15:25,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2022-07-21 02:15:25,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:15:25,376 INFO L356 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-07-21 02:15:25,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 34 [2022-07-21 02:15:25,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:15:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:15:25,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:15:25,504 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_652))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))) (_ bv0 32)))) is different from false [2022-07-21 02:15:25,527 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_654) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_652))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_653) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (_ bv0 32)))) is different from false [2022-07-21 02:15:25,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_654) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_652))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_653) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (_ bv0 32)))) is different from false [2022-07-21 02:15:25,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_654) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_652))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_653) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-21 02:15:25,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:15:25,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349461536] [2022-07-21 02:15:25,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349461536] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:15:25,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1506761766] [2022-07-21 02:15:25,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:15:25,893 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 02:15:25,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 02:15:25,894 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 02:15:25,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-21 02:15:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:26,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-21 02:15:26,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:15:26,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:15:26,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-21 02:15:27,117 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:15:27,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2022-07-21 02:15:27,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:15:27,408 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:15:27,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-07-21 02:15:27,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:15:27,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 31 [2022-07-21 02:15:27,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-21 02:15:27,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:15:30,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:30,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:30,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:30,400 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 02:15:30,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 66 [2022-07-21 02:15:30,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:30,426 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-21 02:15:30,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 28 [2022-07-21 02:15:30,500 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:15:30,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 02:15:30,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:15:31,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:31,653 INFO L356 Elim1Store]: treesize reduction 70, result has 22.2 percent of original size [2022-07-21 02:15:31,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 113 treesize of output 94 [2022-07-21 02:15:31,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:31,704 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-21 02:15:31,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2022-07-21 02:15:31,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:15:31,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:15:31,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 33 [2022-07-21 02:15:32,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:15:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:15:32,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:15:32,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_770 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_769 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_767 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_770) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-07-21 02:15:32,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_770 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_769 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_767 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_769) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_766) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_770) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (_ bv0 32)))) is different from false [2022-07-21 02:15:35,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1506761766] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:15:35,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:15:35,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2022-07-21 02:15:35,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031296241] [2022-07-21 02:15:35,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:15:35,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-21 02:15:35,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:15:35,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-21 02:15:35,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2867, Unknown=19, NotChecked=678, Total=3782 [2022-07-21 02:15:35,038 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 40 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:15:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:15:43,885 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-07-21 02:15:43,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 02:15:43,886 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 40 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2022-07-21 02:15:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:15:43,890 INFO L225 Difference]: With dead ends: 48 [2022-07-21 02:15:43,890 INFO L226 Difference]: Without dead ends: 45 [2022-07-21 02:15:43,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1338 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=397, Invalid=4720, Unknown=19, NotChecked=870, Total=6006 [2022-07-21 02:15:43,894 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:15:43,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 447 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 263 Invalid, 0 Unknown, 223 Unchecked, 1.1s Time] [2022-07-21 02:15:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-21 02:15:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-07-21 02:15:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:15:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-07-21 02:15:43,918 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 42 [2022-07-21 02:15:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:15:43,919 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-07-21 02:15:43,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 40 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:15:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-07-21 02:15:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 02:15:43,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:15:43,923 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:15:43,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2022-07-21 02:15:44,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-21 02:15:44,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:15:44,328 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:15:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:15:44,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1146227584, now seen corresponding path program 1 times [2022-07-21 02:15:44,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:15:44,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885283659] [2022-07-21 02:15:44,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:15:44,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:15:44,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:15:44,331 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:15:44,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 02:15:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:44,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-21 02:15:44,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:15:44,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:15:44,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:15:44,774 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:15:44,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 02:15:44,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:15:45,019 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-21 02:15:45,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-21 02:15:45,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:15:45,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:45,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 02:15:45,236 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:15:45,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-07-21 02:15:45,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 02:15:45,623 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 02:15:45,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 35 [2022-07-21 02:15:45,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:15:45,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-21 02:15:45,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:15:45,891 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:15:45,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 02:15:45,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:15:45,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:45,928 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:15:45,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 66 [2022-07-21 02:15:45,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:45,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 02:15:45,968 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-21 02:15:45,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2022-07-21 02:15:46,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:15:46,906 INFO L356 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-07-21 02:15:46,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 91 [2022-07-21 02:15:46,971 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-21 02:15:46,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 133 [2022-07-21 02:15:46,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2022-07-21 02:15:47,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2022-07-21 02:15:47,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:47,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-21 02:15:47,199 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-07-21 02:15:47,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 40 [2022-07-21 02:15:47,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:15:47,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:15:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:15:47,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:15:47,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_899) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_894) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-21 02:15:47,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_15| (_ BitVec 32)) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_15| (_ bv4 32)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_899) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_894) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-21 02:15:47,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_15| (_ BitVec 32)) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_15| (_ bv4 32)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_899) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_894) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-21 02:15:47,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_15| (_ BitVec 32)) (v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_15| (_ bv4 32)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_899) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_894) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-21 02:15:48,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:15:48,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885283659] [2022-07-21 02:15:48,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885283659] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:15:48,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1024410296] [2022-07-21 02:15:48,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:15:48,639 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 02:15:48,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 02:15:48,641 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 02:15:48,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-07-21 02:15:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:15:49,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-21 02:15:49,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:15:49,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:15:50,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-21 02:15:50,518 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:15:50,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2022-07-21 02:15:50,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:15:50,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:50,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 02:15:50,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:15:50,965 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:15:50,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 64 [2022-07-21 02:15:50,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 02:15:50,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 02:15:51,842 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:15:51,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 37 [2022-07-21 02:15:51,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:15:51,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:15:51,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:15:51,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:15:52,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:52,167 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:15:52,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 68 [2022-07-21 02:15:52,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:52,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 02:15:52,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:52,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:52,196 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 02:15:52,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 02:15:52,224 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 02:15:52,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-07-21 02:15:53,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:53,599 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-21 02:15:53,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 139 treesize of output 114 [2022-07-21 02:15:53,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:53,667 INFO L356 Elim1Store]: treesize reduction 66, result has 23.3 percent of original size [2022-07-21 02:15:53,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 71 [2022-07-21 02:15:53,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:53,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:15:53,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2022-07-21 02:15:54,152 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:15:54,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 36 [2022-07-21 02:15:54,168 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:15:54,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-07-21 02:15:54,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:15:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:15:54,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:15:54,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1028 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1025 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1027) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1030) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1031) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1028) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1025) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-21 02:15:54,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1028 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1025 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1027) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1030) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1031) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1028) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1025) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-21 02:15:54,415 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1028 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1025 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1027) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1030) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1031) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1028) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1025) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-21 02:15:54,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1028 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1025 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1027) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1030) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1031) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1028) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1025) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-21 02:15:55,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1024410296] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:15:55,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:15:55,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 49 [2022-07-21 02:15:55,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094873796] [2022-07-21 02:15:55,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:15:55,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-21 02:15:55,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:15:55,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-21 02:15:55,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2674, Unknown=19, NotChecked=888, Total=3782 [2022-07-21 02:15:55,264 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 49 states, 47 states have (on average 1.425531914893617) internal successors, (67), 38 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:16:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:16:00,829 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-07-21 02:16:00,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 02:16:00,830 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.425531914893617) internal successors, (67), 38 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-07-21 02:16:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:16:00,831 INFO L225 Difference]: With dead ends: 55 [2022-07-21 02:16:00,831 INFO L226 Difference]: Without dead ends: 53 [2022-07-21 02:16:00,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=377, Invalid=4606, Unknown=19, NotChecked=1160, Total=6162 [2022-07-21 02:16:00,833 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 02:16:00,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 495 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 493 Invalid, 0 Unknown, 217 Unchecked, 1.6s Time] [2022-07-21 02:16:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-21 02:16:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2022-07-21 02:16:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:16:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-07-21 02:16:00,848 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 44 [2022-07-21 02:16:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:16:00,848 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-07-21 02:16:00,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.425531914893617) internal successors, (67), 38 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:16:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-07-21 02:16:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 02:16:00,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:16:00,851 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:16:00,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-07-21 02:16:01,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-21 02:16:01,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:16:01,263 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:16:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:16:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash 705409183, now seen corresponding path program 2 times [2022-07-21 02:16:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:16:01,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364906014] [2022-07-21 02:16:01,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:16:01,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:16:01,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:16:01,266 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:16:01,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 02:16:01,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:16:01,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:16:01,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-21 02:16:01,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:16:01,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:16:01,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:16:01,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:16:02,006 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:16:02,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2022-07-21 02:16:02,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:16:02,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:16:02,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-21 02:16:02,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:16:02,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-21 02:16:02,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:16:02,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:16:02,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:16:02,216 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:16:02,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 59 [2022-07-21 02:16:02,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-21 02:16:02,569 INFO L356 Elim1Store]: treesize reduction 11, result has 66.7 percent of original size [2022-07-21 02:16:02,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 61 [2022-07-21 02:16:02,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:16:02,589 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 02:16:02,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-07-21 02:16:02,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:16:02,778 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:16:02,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 78 [2022-07-21 02:16:02,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:16:02,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:16:02,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:16:02,797 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-21 02:16:02,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2022-07-21 02:16:02,822 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 02:16:02,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-07-21 02:16:03,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:16:03,293 INFO L356 Elim1Store]: treesize reduction 88, result has 24.1 percent of original size [2022-07-21 02:16:03,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 103 [2022-07-21 02:16:03,332 INFO L356 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2022-07-21 02:16:03,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 29 [2022-07-21 02:16:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:16:03,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:16:03,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:16:03,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364906014] [2022-07-21 02:16:03,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364906014] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:16:03,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [277251153] [2022-07-21 02:16:03,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:16:03,861 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 02:16:03,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 02:16:03,863 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 02:16:03,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-07-21 02:16:04,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:16:04,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:16:04,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-21 02:16:04,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:16:04,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:16:05,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-21 02:16:05,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:16:05,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-21 02:16:05,498 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:16:05,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 02:16:05,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:16:05,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:16:05,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-21 02:16:05,554 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 02:16:05,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-21 02:16:07,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:16:07,788 INFO L356 Elim1Store]: treesize reduction 159, result has 28.4 percent of original size [2022-07-21 02:16:07,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 231 treesize of output 145 [2022-07-21 02:16:07,945 INFO L356 Elim1Store]: treesize reduction 88, result has 29.6 percent of original size [2022-07-21 02:16:07,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 208 treesize of output 208 [2022-07-21 02:16:07,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:16:08,036 INFO L356 Elim1Store]: treesize reduction 100, result has 16.0 percent of original size [2022-07-21 02:16:08,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 209 treesize of output 179 [2022-07-21 02:16:08,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:16:08,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:16:08,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-07-21 02:16:10,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-07-21 02:16:10,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-07-21 02:16:10,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2022-07-21 02:16:10,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-07-21 02:16:10,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-07-21 02:16:11,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-07-21 02:16:12,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:16:12,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2022-07-21 02:16:13,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2022-07-21 02:16:23,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2022-07-21 02:16:28,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2022-07-21 02:17:12,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:17:13,352 INFO L356 Elim1Store]: treesize reduction 176, result has 65.4 percent of original size [2022-07-21 02:17:13,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 492 treesize of output 473 [2022-07-21 02:17:13,402 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-21 02:17:13,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 480 treesize of output 454 [2022-07-21 02:17:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:17:56,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:17:56,341 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1266 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4 v_ArrVal_1267)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1266)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1262))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (not (= (select (select .cse0 .cse1) .cse2) (_ bv0 32))) (not (= (select (select .cse3 .cse1) .cse2) (_ bv0 32)))))))) is different from false [2022-07-21 02:17:59,955 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1267 (_ BitVec 32)) (v_ArrVal_1262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1266 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_26| (_ BitVec 32)) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_append_~last~0#1.offset|)))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse7)) (.cse3 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_26| (_ bv4 32)))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse7 (store .cse3 .cse4 v_ArrVal_1267)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1266)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse7 (store .cse5 .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1262))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (not (= (select (select .cse0 .cse1) .cse2) (_ bv0 32))) (not (= (select .cse3 .cse4) (_ bv0 32))) (not (= (select .cse5 .cse4) (_ bv0 32))) (not (= (select (select .cse6 .cse1) .cse2) (_ bv0 32))))))))) is different from false [2022-07-21 02:18:13,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [277251153] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:13,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:18:13,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2022-07-21 02:18:13,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223793572] [2022-07-21 02:18:13,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:18:13,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-21 02:18:13,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:18:13,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-21 02:18:13,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3065, Unknown=27, NotChecked=226, Total=3540 [2022-07-21 02:18:13,502 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 46 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 40 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 02:18:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:18,224 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2022-07-21 02:18:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-21 02:18:18,225 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 40 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-07-21 02:18:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:18,227 INFO L225 Difference]: With dead ends: 80 [2022-07-21 02:18:18,227 INFO L226 Difference]: Without dead ends: 67 [2022-07-21 02:18:18,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1673 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=383, Invalid=5297, Unknown=28, NotChecked=298, Total=6006 [2022-07-21 02:18:18,230 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:18,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 490 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 312 Invalid, 0 Unknown, 331 Unchecked, 1.2s Time] [2022-07-21 02:18:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-21 02:18:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-07-21 02:18:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 58 states have internal predecessors, (68), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:18:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-07-21 02:18:18,248 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 44 [2022-07-21 02:18:18,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:18,248 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-07-21 02:18:18,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 40 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 02:18:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-07-21 02:18:18,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 02:18:18,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:18,251 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:18,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2022-07-21 02:18:18,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-21 02:18:18,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:18:18,656 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:18,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1173262244, now seen corresponding path program 1 times [2022-07-21 02:18:18,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:18:18,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145759025] [2022-07-21 02:18:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:18,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:18:18,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:18:18,659 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:18:18,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-21 02:18:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:18,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 02:18:18,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:18,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-21 02:18:18,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 02:18:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 02:18:18,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:18:18,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:18:18,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145759025] [2022-07-21 02:18:18,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145759025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:18:18,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:18:18,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 02:18:18,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578734990] [2022-07-21 02:18:18,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:18:18,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 02:18:18,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:18:18,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 02:18:18,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:18:18,957 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 02:18:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:19,125 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2022-07-21 02:18:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 02:18:19,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-21 02:18:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:19,127 INFO L225 Difference]: With dead ends: 75 [2022-07-21 02:18:19,127 INFO L226 Difference]: Without dead ends: 70 [2022-07-21 02:18:19,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:18:19,127 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:19,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 108 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:18:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-21 02:18:19,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-07-21 02:18:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:18:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-07-21 02:18:19,148 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 45 [2022-07-21 02:18:19,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:19,148 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-07-21 02:18:19,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 02:18:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-07-21 02:18:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 02:18:19,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:19,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:19,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-21 02:18:19,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:18:19,356 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:19,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2018358036, now seen corresponding path program 1 times [2022-07-21 02:18:19,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:18:19,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997034398] [2022-07-21 02:18:19,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:19,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:18:19,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:18:19,358 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:18:19,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-21 02:18:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:19,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-21 02:18:19,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:19,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:18:19,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:18:19,966 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:18:19,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 02:18:20,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:20,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 02:18:20,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:18:20,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:18:20,259 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:18:20,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 02:18:20,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:18:20,309 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-21 02:18:20,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-21 02:18:20,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:18:20,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:18:20,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:18:20,548 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:18:20,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 85 [2022-07-21 02:18:20,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 02:18:20,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2022-07-21 02:18:20,980 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 02:18:20,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 44 [2022-07-21 02:18:20,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:18:21,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:18:21,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-07-21 02:18:21,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:21,230 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:18:21,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 77 [2022-07-21 02:18:21,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:21,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 02:18:21,272 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-21 02:18:21,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 44 [2022-07-21 02:18:21,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 02:18:22,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:18:22,293 INFO L356 Elim1Store]: treesize reduction 127, result has 15.9 percent of original size [2022-07-21 02:18:22,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 127 [2022-07-21 02:18:22,350 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-21 02:18:22,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 401 treesize of output 274 [2022-07-21 02:18:22,413 INFO L356 Elim1Store]: treesize reduction 102, result has 16.4 percent of original size [2022-07-21 02:18:22,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 360 treesize of output 301 [2022-07-21 02:18:22,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:22,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2022-07-21 02:18:22,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2022-07-21 02:18:22,974 INFO L356 Elim1Store]: treesize reduction 45, result has 8.2 percent of original size [2022-07-21 02:18:22,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 224 treesize of output 75 [2022-07-21 02:18:22,991 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 02:18:22,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-21 02:18:23,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:18:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:18:23,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:23,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1490 (_ BitVec 32)) (v_ArrVal_1488 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1492) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1488)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1489))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1490)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1494) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-21 02:18:23,571 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1490 (_ BitVec 32)) (v_ArrVal_1488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1492) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1488)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1489))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1490)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1494) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-07-21 02:18:23,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1490 (_ BitVec 32)) (v_ArrVal_1488 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1492) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1488)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1489))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1490)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1494) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-21 02:18:23,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1494 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1490 (_ BitVec 32)) (v_ArrVal_1488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1492) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1488)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1489))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1490)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1494) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-07-21 02:18:24,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:18:24,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997034398] [2022-07-21 02:18:24,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997034398] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:24,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [915486552] [2022-07-21 02:18:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:24,765 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 02:18:24,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 02:18:24,766 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 02:18:24,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-07-21 02:18:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:25,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-21 02:18:25,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:25,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:18:25,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:25,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 02:18:26,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:18:26,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-21 02:18:26,694 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:18:26,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2022-07-21 02:18:26,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:18:26,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:18:26,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:18:26,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:18:27,136 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:18:27,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 84 [2022-07-21 02:18:27,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 02:18:27,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2022-07-21 02:18:27,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:18:27,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 40 [2022-07-21 02:18:28,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:18:28,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 02:18:28,023 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:18:28,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:18:28,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:28,355 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:18:28,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 71 [2022-07-21 02:18:28,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:28,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 02:18:28,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:28,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:28,382 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 02:18:28,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 02:18:28,407 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 02:18:28,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 35 [2022-07-21 02:18:29,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:29,683 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-21 02:18:29,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 178 treesize of output 141 [2022-07-21 02:18:29,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:29,738 INFO L356 Elim1Store]: treesize reduction 66, result has 23.3 percent of original size [2022-07-21 02:18:29,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 96 [2022-07-21 02:18:29,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:18:29,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:29,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2022-07-21 02:18:29,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 02:18:30,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:18:30,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:18:30,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 52 [2022-07-21 02:18:30,667 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-21 02:18:30,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-07-21 02:18:30,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:18:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:18:30,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:30,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1623 (_ BitVec 32)) (v_ArrVal_1630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1627) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1629)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1624) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1626))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|) v_ArrVal_1623)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1630) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2022-07-21 02:18:31,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1623 (_ BitVec 32)) (v_ArrVal_1630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1627) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1629)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1624) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1626))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1)) v_ArrVal_1623)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1630) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-21 02:18:31,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1623 (_ BitVec 32)) (v_ArrVal_1630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1627) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1629)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1624) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1626))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (_ bv4 32) (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) v_ArrVal_1623)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1630) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))) is different from false [2022-07-21 02:18:31,165 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1623 (_ BitVec 32)) (v_ArrVal_1630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1627) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1629)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1624) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1626))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvadd (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) v_ArrVal_1623)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1630) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))) is different from false [2022-07-21 02:18:32,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [915486552] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:32,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:18:32,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 53 [2022-07-21 02:18:32,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727540082] [2022-07-21 02:18:32,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:18:32,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-21 02:18:32,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:18:32,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-21 02:18:32,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3226, Unknown=13, NotChecked=968, Total=4422 [2022-07-21 02:18:32,932 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 53 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 41 states have internal predecessors, (76), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:18:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:38,911 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2022-07-21 02:18:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 02:18:38,912 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 41 states have internal predecessors, (76), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-07-21 02:18:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:38,912 INFO L225 Difference]: With dead ends: 74 [2022-07-21 02:18:38,912 INFO L226 Difference]: Without dead ends: 72 [2022-07-21 02:18:38,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=388, Invalid=5331, Unknown=13, NotChecked=1240, Total=6972 [2022-07-21 02:18:38,914 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 50 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:38,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 396 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 417 Invalid, 0 Unknown, 198 Unchecked, 1.4s Time] [2022-07-21 02:18:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-21 02:18:38,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-07-21 02:18:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:18:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-07-21 02:18:38,923 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 47 [2022-07-21 02:18:38,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:38,923 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-07-21 02:18:38,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 41 states have internal predecessors, (76), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:18:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-07-21 02:18:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 02:18:38,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:38,924 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:38,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-21 02:18:39,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2022-07-21 02:18:39,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-21 02:18:39,340 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:39,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1855355832, now seen corresponding path program 1 times [2022-07-21 02:18:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:18:39,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582555416] [2022-07-21 02:18:39,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:39,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:18:39,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:18:39,342 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:18:39,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-21 02:18:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:39,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-21 02:18:39,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:39,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:18:39,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:18:39,870 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:18:39,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 02:18:39,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:18:40,063 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-21 02:18:40,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-21 02:18:40,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:18:40,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:18:40,270 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:18:40,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-07-21 02:18:40,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 02:18:40,654 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 02:18:40,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 35 [2022-07-21 02:18:40,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:18:40,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-21 02:18:40,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:40,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:40,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 02:18:40,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:40,870 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:18:40,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 66 [2022-07-21 02:18:40,909 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-21 02:18:40,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2022-07-21 02:18:41,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:18:41,674 INFO L356 Elim1Store]: treesize reduction 133, result has 11.9 percent of original size [2022-07-21 02:18:41,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 105 [2022-07-21 02:18:41,727 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-21 02:18:41,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 295 treesize of output 210 [2022-07-21 02:18:41,745 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:18:41,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 164 [2022-07-21 02:18:41,801 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-21 02:18:41,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 140 [2022-07-21 02:18:42,244 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 02:18:42,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 114 [2022-07-21 02:18:42,381 INFO L356 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-07-21 02:18:42,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 37 [2022-07-21 02:18:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:18:42,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:42,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1753 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1750)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1753))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (bvadd (_ bv4 32) (select (select .cse3 .cse1) .cse2)))))) (_ bv0 32)))) is different from false