./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.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 --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 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:43:04,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:43:04,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:43:04,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:43:04,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:43:04,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:43:04,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:43:04,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:43:04,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:43:04,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:43:04,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:43:04,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:43:04,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:43:04,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:43:04,496 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:43:04,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:43:04,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:43:04,497 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:43:04,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:43:04,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:43:04,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:43:04,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:43:04,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:43:04,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:43:04,503 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:43:04,503 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:43:04,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:43:04,503 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:43:04,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:43:04,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:43:04,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:43:04,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:43:04,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:43:04,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:43:04,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:43:04,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:43:04,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:43:04,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:43:04,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:43:04,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:43:04,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:43:04,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:43:04,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2024-11-19 20:43:04,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:43:04,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:43:04,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:43:04,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:43:04,799 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:43:04,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-11-19 20:43:06,256 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:43:06,519 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:43:06,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-11-19 20:43:06,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b888e917c/bdc4603a2ece413281ed6b7576000c94/FLAG8aebbe79b [2024-11-19 20:43:06,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b888e917c/bdc4603a2ece413281ed6b7576000c94 [2024-11-19 20:43:06,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:43:06,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:43:06,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:43:06,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:43:06,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:43:06,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:43:06" (1/1) ... [2024-11-19 20:43:06,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c0eb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:06, skipping insertion in model container [2024-11-19 20:43:06,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:43:06" (1/1) ... [2024-11-19 20:43:06,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:43:06,903 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2024-11-19 20:43:06,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:43:06,942 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:43:06,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2024-11-19 20:43:07,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:43:07,048 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:43:07,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07 WrapperNode [2024-11-19 20:43:07,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:43:07,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:43:07,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:43:07,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:43:07,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07" (1/1) ... [2024-11-19 20:43:07,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07" (1/1) ... [2024-11-19 20:43:07,097 INFO L138 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 205 [2024-11-19 20:43:07,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:43:07,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:43:07,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:43:07,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:43:07,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07" (1/1) ... [2024-11-19 20:43:07,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07" (1/1) ... [2024-11-19 20:43:07,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07" (1/1) ... [2024-11-19 20:43:07,143 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 8, 18, 6, 8]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 1, 0]. The 10 writes are split as follows [0, 1, 7, 1, 1]. [2024-11-19 20:43:07,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07" (1/1) ... [2024-11-19 20:43:07,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07" (1/1) ... [2024-11-19 20:43:07,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07" (1/1) ... [2024-11-19 20:43:07,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07" (1/1) ... [2024-11-19 20:43:07,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07" (1/1) ... [2024-11-19 20:43:07,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07" (1/1) ... [2024-11-19 20:43:07,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:43:07,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:43:07,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:43:07,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:43:07,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07" (1/1) ... [2024-11-19 20:43:07,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:43:07,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:43:07,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 20:43:07,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 20:43:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-19 20:43:07,248 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-19 20:43:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:43:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:43:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:43:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:43:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:43:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 20:43:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 20:43:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-19 20:43:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:43:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:43:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 20:43:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 20:43:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-19 20:43:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-11-19 20:43:07,251 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-11-19 20:43:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:43:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 20:43:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 20:43:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 20:43:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-19 20:43:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-19 20:43:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-11-19 20:43:07,252 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-11-19 20:43:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:43:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:43:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 20:43:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 20:43:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 20:43:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-11-19 20:43:07,254 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-11-19 20:43:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:43:07,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:43:07,449 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:43:07,451 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:43:07,734 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-19 20:43:07,735 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:43:07,754 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:43:07,755 INFO L316 CfgBuilder]: Removed 33 assume(true) statements. [2024-11-19 20:43:07,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:43:07 BoogieIcfgContainer [2024-11-19 20:43:07,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:43:07,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:43:07,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:43:07,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:43:07,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:43:06" (1/3) ... [2024-11-19 20:43:07,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e58425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:43:07, skipping insertion in model container [2024-11-19 20:43:07,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:43:07" (2/3) ... [2024-11-19 20:43:07,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e58425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:43:07, skipping insertion in model container [2024-11-19 20:43:07,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:43:07" (3/3) ... [2024-11-19 20:43:07,765 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2024-11-19 20:43:07,781 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:43:07,781 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:43:07,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:43:07,842 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@20a74cff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:43:07,843 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:43:07,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 76 states have (on average 1.644736842105263) internal successors, (125), 82 states have internal predecessors, (125), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 20:43:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 20:43:07,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:43:07,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:43:07,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:43:07,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:43:07,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1657014822, now seen corresponding path program 1 times [2024-11-19 20:43:07,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:43:07,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033145448] [2024-11-19 20:43:07,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:43:07,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:43:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:43:08,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:43:08,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033145448] [2024-11-19 20:43:08,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033145448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:43:08,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:43:08,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 20:43:08,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498920990] [2024-11-19 20:43:08,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:43:08,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 20:43:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:43:08,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 20:43:08,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 20:43:08,106 INFO L87 Difference]: Start difference. First operand has 96 states, 76 states have (on average 1.644736842105263) internal successors, (125), 82 states have internal predecessors, (125), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:43:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:43:08,143 INFO L93 Difference]: Finished difference Result 188 states and 324 transitions. [2024-11-19 20:43:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 20:43:08,145 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 20:43:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:43:08,153 INFO L225 Difference]: With dead ends: 188 [2024-11-19 20:43:08,153 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 20:43:08,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 20:43:08,162 INFO L432 NwaCegarLoop]: 115 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, 115 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 [2024-11-19 20:43:08,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:43:08,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 20:43:08,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-19 20:43:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 75 states have internal predecessors, (83), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:43:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-11-19 20:43:08,214 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 16 [2024-11-19 20:43:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:43:08,214 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-11-19 20:43:08,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:43:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2024-11-19 20:43:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 20:43:08,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:43:08,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:43:08,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:43:08,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:43:08,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:43:08,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2140317213, now seen corresponding path program 1 times [2024-11-19 20:43:08,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:43:08,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210070401] [2024-11-19 20:43:08,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:43:08,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:43:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:09,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:43:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:09,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:43:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:09,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:43:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 20:43:09,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:43:09,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210070401] [2024-11-19 20:43:09,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210070401] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:43:09,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041261120] [2024-11-19 20:43:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:43:09,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:43:09,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:43:09,392 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) [2024-11-19 20:43:09,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 20:43:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:09,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-19 20:43:09,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:43:09,725 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 20:43:09,774 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 16 [2024-11-19 20:43:09,783 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 20:43:09,880 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:43:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:43:09,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:43:09,931 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 30 [2024-11-19 20:43:10,032 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 26 [2024-11-19 20:43:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 20:43:10,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041261120] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:43:10,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:43:10,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 13 [2024-11-19 20:43:10,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127036693] [2024-11-19 20:43:10,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:43:10,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 20:43:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:43:10,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 20:43:10,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-19 20:43:10,098 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 20:43:14,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:18,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:22,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:26,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:30,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:34,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:38,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:43:38,918 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2024-11-19 20:43:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 20:43:38,919 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-11-19 20:43:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:43:38,921 INFO L225 Difference]: With dead ends: 116 [2024-11-19 20:43:38,922 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 20:43:38,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2024-11-19 20:43:38,923 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 183 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 41 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2024-11-19 20:43:38,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 432 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 634 Invalid, 7 Unknown, 0 Unchecked, 28.6s Time] [2024-11-19 20:43:38,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 20:43:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2024-11-19 20:43:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 91 states have internal predecessors, (102), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:43:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2024-11-19 20:43:38,957 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 40 [2024-11-19 20:43:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:43:38,957 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2024-11-19 20:43:38,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 20:43:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2024-11-19 20:43:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 20:43:38,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:43:38,959 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:43:38,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 20:43:39,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:43:39,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:43:39,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:43:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash -451191033, now seen corresponding path program 1 times [2024-11-19 20:43:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:43:39,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429064402] [2024-11-19 20:43:39,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:43:39,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:43:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:39,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:43:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:39,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:43:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:39,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:43:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 20:43:39,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:43:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429064402] [2024-11-19 20:43:39,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429064402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:43:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42833509] [2024-11-19 20:43:39,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:43:39,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:43:39,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:43:39,771 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) [2024-11-19 20:43:39,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 20:43:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:43:39,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 20:43:39,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:43:39,994 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 20:43:40,026 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 11 [2024-11-19 20:43:40,062 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 12 [2024-11-19 20:43:40,104 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 12 [2024-11-19 20:43:40,170 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:43:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 20:43:40,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:43:40,247 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 30 [2024-11-19 20:43:40,311 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 26 [2024-11-19 20:43:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 20:43:40,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42833509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:43:40,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:43:40,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 14 [2024-11-19 20:43:40,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016662396] [2024-11-19 20:43:40,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:43:40,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 20:43:40,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:43:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 20:43:40,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-19 20:43:40,332 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 14 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 20:43:44,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:48,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:52,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:56,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:44:00,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:44:04,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:44:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:44:05,122 INFO L93 Difference]: Finished difference Result 126 states and 147 transitions. [2024-11-19 20:44:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 20:44:05,123 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-11-19 20:44:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:44:05,124 INFO L225 Difference]: With dead ends: 126 [2024-11-19 20:44:05,124 INFO L226 Difference]: Without dead ends: 123 [2024-11-19 20:44:05,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2024-11-19 20:44:05,127 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 148 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 34 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2024-11-19 20:44:05,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 476 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 650 Invalid, 6 Unknown, 0 Unchecked, 24.5s Time] [2024-11-19 20:44:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-19 20:44:05,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2024-11-19 20:44:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 88 states have (on average 1.2045454545454546) internal successors, (106), 96 states have internal predecessors, (106), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:44:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2024-11-19 20:44:05,147 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 42 [2024-11-19 20:44:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:44:05,149 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2024-11-19 20:44:05,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 20:44:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2024-11-19 20:44:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 20:44:05,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:44:05,151 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:44:05,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 20:44:05,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 20:44:05,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:44:05,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:44:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1290334861, now seen corresponding path program 1 times [2024-11-19 20:44:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:44:05,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825608159] [2024-11-19 20:44:05,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:05,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:44:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:06,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:44:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:06,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:44:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:06,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:44:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:44:06,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:44:06,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825608159] [2024-11-19 20:44:06,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825608159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:44:06,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493118604] [2024-11-19 20:44:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:06,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:44:06,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:44:06,848 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) [2024-11-19 20:44:06,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 20:44:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:07,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-19 20:44:07,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:44:07,303 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-19 20:44:07,308 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 3 [2024-11-19 20:44:07,340 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:44:07,467 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 15 [2024-11-19 20:44:07,541 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 39 treesize of output 16 [2024-11-19 20:44:07,554 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-19 20:44:07,632 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-19 20:44:07,643 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 11 [2024-11-19 20:44:07,715 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 21 [2024-11-19 20:44:07,720 INFO L378 Elim1Store]: Elim1 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 12 treesize of output 4 [2024-11-19 20:44:07,724 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 3 [2024-11-19 20:44:07,885 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_9|) 0)) (exists ((|v_chain_node_alloc_node_#res#1.base_38| Int)) (and (= (select |c_old(#valid)| |v_chain_node_alloc_node_#res#1.base_38|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |v_chain_node_alloc_node_#res#1.base_38| (select |c_#memory_$Pointer$#2.base| |v_chain_node_alloc_node_#res#1.base_38|)) |c_#memory_$Pointer$#2.base|)))) is different from true [2024-11-19 20:44:07,906 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 21 [2024-11-19 20:44:07,921 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 20:44:07,921 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 15 [2024-11-19 20:44:07,926 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 16 [2024-11-19 20:44:08,015 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 12 [2024-11-19 20:44:08,155 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 8 [2024-11-19 20:44:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-19 20:44:08,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:44:08,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493118604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:44:08,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:44:08,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 40 [2024-11-19 20:44:08,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610479183] [2024-11-19 20:44:08,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:44:08,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-19 20:44:08,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:44:08,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-19 20:44:08,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1760, Unknown=1, NotChecked=84, Total=1980 [2024-11-19 20:44:08,486 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand has 40 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 35 states have internal predecessors, (69), 8 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 20:44:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:44:10,639 INFO L93 Difference]: Finished difference Result 220 states and 262 transitions. [2024-11-19 20:44:10,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 20:44:10,639 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 35 states have internal predecessors, (69), 8 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2024-11-19 20:44:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:44:10,641 INFO L225 Difference]: With dead ends: 220 [2024-11-19 20:44:10,641 INFO L226 Difference]: Without dead ends: 217 [2024-11-19 20:44:10,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=295, Invalid=3248, Unknown=1, NotChecked=116, Total=3660 [2024-11-19 20:44:10,643 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 406 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 2507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 20:44:10,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1012 Invalid, 2507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2161 Invalid, 0 Unknown, 234 Unchecked, 1.5s Time] [2024-11-19 20:44:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-19 20:44:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 141. [2024-11-19 20:44:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 112 states have (on average 1.1964285714285714) internal successors, (134), 122 states have internal predecessors, (134), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 20:44:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 165 transitions. [2024-11-19 20:44:10,675 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 165 transitions. Word has length 46 [2024-11-19 20:44:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:44:10,679 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 165 transitions. [2024-11-19 20:44:10,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 35 states have internal predecessors, (69), 8 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 20:44:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2024-11-19 20:44:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 20:44:10,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:44:10,680 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:44:10,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 20:44:10,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:44:10,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:44:10,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:44:10,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1333501862, now seen corresponding path program 1 times [2024-11-19 20:44:10,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:44:10,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868081302] [2024-11-19 20:44:10,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:10,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:44:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:12,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:44:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:12,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:44:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:12,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:44:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:12,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 20:44:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:44:12,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:44:12,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868081302] [2024-11-19 20:44:12,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868081302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:44:12,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120538107] [2024-11-19 20:44:12,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:12,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:44:12,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:44:12,888 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) [2024-11-19 20:44:12,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 20:44:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:13,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-19 20:44:13,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:44:13,121 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:44:13,162 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 9 [2024-11-19 20:44:13,170 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:44:13,222 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 43 [2024-11-19 20:44:13,229 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 35 treesize of output 15 [2024-11-19 20:44:13,232 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 20:44:13,238 INFO L378 Elim1Store]: Elim1 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 53 treesize of output 21 [2024-11-19 20:44:13,369 INFO L378 Elim1Store]: Elim1 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 50 treesize of output 38 [2024-11-19 20:44:13,374 INFO L378 Elim1Store]: Elim1 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 59 treesize of output 43 [2024-11-19 20:44:13,388 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 20:44:13,392 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 20:44:13,460 INFO L378 Elim1Store]: Elim1 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 17 treesize of output 3 [2024-11-19 20:44:13,465 INFO L378 Elim1Store]: Elim1 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 17 treesize of output 3 [2024-11-19 20:44:13,471 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 3 [2024-11-19 20:44:13,572 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_chain_node_alloc_node_#res#1.base_45| Int)) (and (= (select |c_old(#valid)| |v_chain_node_alloc_node_#res#1.base_45|) 0) (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_chain_node_alloc_node_#res#1.base_45| (select |c_#memory_$Pointer$#2.base| |v_chain_node_alloc_node_#res#1.base_45|))) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_chain_node_alloc_node_#res#1.base_45| (select |c_#memory_$Pointer$#2.offset| |v_chain_node_alloc_node_#res#1.base_45|))))) is different from true [2024-11-19 20:44:13,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:44:13,596 INFO L378 Elim1Store]: Elim1 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 26 treesize of output 21 [2024-11-19 20:44:13,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:44:13,604 INFO L378 Elim1Store]: Elim1 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 26 treesize of output 21 [2024-11-19 20:44:13,613 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 20:44:13,613 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 15 [2024-11-19 20:44:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-19 20:44:13,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:44:14,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120538107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:44:14,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:44:14,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 29 [2024-11-19 20:44:14,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405290928] [2024-11-19 20:44:14,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:44:14,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 20:44:14,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:44:14,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 20:44:14,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=726, Unknown=1, NotChecked=54, Total=870 [2024-11-19 20:44:14,057 INFO L87 Difference]: Start difference. First operand 141 states and 165 transitions. Second operand has 29 states, 25 states have (on average 3.04) internal successors, (76), 27 states have internal predecessors, (76), 7 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-19 20:44:15,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:44:15,945 INFO L93 Difference]: Finished difference Result 212 states and 250 transitions. [2024-11-19 20:44:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 20:44:15,946 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 3.04) internal successors, (76), 27 states have internal predecessors, (76), 7 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 50 [2024-11-19 20:44:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:44:15,948 INFO L225 Difference]: With dead ends: 212 [2024-11-19 20:44:15,948 INFO L226 Difference]: Without dead ends: 209 [2024-11-19 20:44:15,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=198, Invalid=1527, Unknown=1, NotChecked=80, Total=1806 [2024-11-19 20:44:15,949 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 244 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:44:15,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 530 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1185 Invalid, 0 Unknown, 206 Unchecked, 1.1s Time] [2024-11-19 20:44:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-19 20:44:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 144. [2024-11-19 20:44:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 115 states have (on average 1.191304347826087) internal successors, (137), 124 states have internal predecessors, (137), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 20:44:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2024-11-19 20:44:15,975 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 50 [2024-11-19 20:44:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:44:15,976 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2024-11-19 20:44:15,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 3.04) internal successors, (76), 27 states have internal predecessors, (76), 7 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-19 20:44:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2024-11-19 20:44:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 20:44:15,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:44:15,977 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:44:15,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 20:44:16,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:44:16,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:44:16,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:44:16,178 INFO L85 PathProgramCache]: Analyzing trace with hash -807381023, now seen corresponding path program 1 times [2024-11-19 20:44:16,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:44:16,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877313196] [2024-11-19 20:44:16,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:16,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:44:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:17,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:44:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:17,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:44:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:17,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:44:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 20:44:17,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:44:17,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877313196] [2024-11-19 20:44:17,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877313196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:44:17,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719528784] [2024-11-19 20:44:17,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:17,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:44:17,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:44:17,707 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) [2024-11-19 20:44:17,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 20:44:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:17,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-11-19 20:44:17,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:44:17,990 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-19 20:44:17,994 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2024-11-19 20:44:18,075 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 11 [2024-11-19 20:44:18,087 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-19 20:44:18,132 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:44:18,195 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:44:18,325 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 15 [2024-11-19 20:44:18,332 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 15 [2024-11-19 20:44:18,442 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 42 treesize of output 19 [2024-11-19 20:44:18,452 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 20:44:18,582 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-19 20:44:18,587 INFO L378 Elim1Store]: Elim1 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 51 treesize of output 35 [2024-11-19 20:44:18,598 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 20:44:18,657 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:44:18,660 INFO L378 Elim1Store]: Elim1 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 3 [2024-11-19 20:44:18,667 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 3 [2024-11-19 20:44:18,892 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_8|) 0)) (exists ((|v_chain_node_alloc_node_#res#1.base_52| Int)) (and (= (select |c_old(#valid)| |v_chain_node_alloc_node_#res#1.base_52|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |v_chain_node_alloc_node_#res#1.base_52| (select |c_#memory_$Pointer$#2.base| |v_chain_node_alloc_node_#res#1.base_52|)) |c_#memory_$Pointer$#2.base|) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_chain_node_alloc_node_#res#1.base_52| (select |c_#memory_$Pointer$#2.offset| |v_chain_node_alloc_node_#res#1.base_52|))))) (exists ((|v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_9|) 0)) (exists ((|v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_17| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_17|) |v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_17|) 0))) is different from true [2024-11-19 20:44:18,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:44:18,919 INFO L378 Elim1Store]: Elim1 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 19 [2024-11-19 20:44:18,931 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 20:44:18,931 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 15 [2024-11-19 20:44:18,935 INFO L378 Elim1Store]: Elim1 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 15 [2024-11-19 20:44:19,089 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 22 [2024-11-19 20:44:19,097 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:44:19,272 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:44:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-19 20:44:19,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:44:19,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719528784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:44:19,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:44:19,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 38 [2024-11-19 20:44:19,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596755895] [2024-11-19 20:44:19,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:44:19,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-19 20:44:19,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:44:19,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 20:44:19,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1304, Unknown=1, NotChecked=72, Total=1482 [2024-11-19 20:44:19,496 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 38 states, 32 states have (on average 2.375) internal successors, (76), 33 states have internal predecessors, (76), 8 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 20:44:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:44:22,018 INFO L93 Difference]: Finished difference Result 311 states and 368 transitions. [2024-11-19 20:44:22,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 20:44:22,018 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 2.375) internal successors, (76), 33 states have internal predecessors, (76), 8 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2024-11-19 20:44:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:44:22,020 INFO L225 Difference]: With dead ends: 311 [2024-11-19 20:44:22,020 INFO L226 Difference]: Without dead ends: 241 [2024-11-19 20:44:22,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=252, Invalid=2831, Unknown=1, NotChecked=108, Total=3192 [2024-11-19 20:44:22,022 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 293 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 1926 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 20:44:22,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 862 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1926 Invalid, 0 Unknown, 224 Unchecked, 1.5s Time] [2024-11-19 20:44:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-19 20:44:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 179. [2024-11-19 20:44:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 142 states have (on average 1.1690140845070423) internal successors, (166), 154 states have internal predecessors, (166), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (16), 12 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 20:44:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 207 transitions. [2024-11-19 20:44:22,056 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 207 transitions. Word has length 50 [2024-11-19 20:44:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:44:22,056 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 207 transitions. [2024-11-19 20:44:22,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 2.375) internal successors, (76), 33 states have internal predecessors, (76), 8 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 20:44:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 207 transitions. [2024-11-19 20:44:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 20:44:22,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:44:22,058 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:44:22,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 20:44:22,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:44:22,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:44:22,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:44:22,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2052192123, now seen corresponding path program 1 times [2024-11-19 20:44:22,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:44:22,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102600755] [2024-11-19 20:44:22,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:22,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:44:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:23,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:44:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:23,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:44:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:24,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:44:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:24,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 20:44:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:44:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:44:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102600755] [2024-11-19 20:44:24,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102600755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:44:24,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168761287] [2024-11-19 20:44:24,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:24,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:44:24,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:44:24,665 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) [2024-11-19 20:44:24,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 20:44:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:24,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-11-19 20:44:24,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:44:24,905 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:44:24,944 INFO L378 Elim1Store]: Elim1 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 14 treesize of output 15 [2024-11-19 20:44:24,953 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 7 [2024-11-19 20:44:25,000 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-19 20:44:25,006 INFO L378 Elim1Store]: Elim1 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 35 treesize of output 30 [2024-11-19 20:44:25,009 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 31 treesize of output 11 [2024-11-19 20:44:25,016 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 18 [2024-11-19 20:44:25,126 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-19 20:44:25,130 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 11 [2024-11-19 20:44:25,189 INFO L378 Elim1Store]: Elim1 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 43 treesize of output 27 [2024-11-19 20:44:25,194 INFO L378 Elim1Store]: Elim1 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 3 [2024-11-19 20:44:25,198 INFO L378 Elim1Store]: Elim1 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 3 [2024-11-19 20:44:25,201 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 3 [2024-11-19 20:44:25,379 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_chain_node_alloc_node_#res#1.base_59| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_chain_node_alloc_node_#res#1.base_59| (select |c_#valid| |v_chain_node_alloc_node_#res#1.base_59|))) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_chain_node_alloc_node_#res#1.base_59| (select |c_#memory_$Pointer$#2.offset| |v_chain_node_alloc_node_#res#1.base_59|))) (= 0 (select |c_old(#valid)| |v_chain_node_alloc_node_#res#1.base_59|)) (= (store |c_old(#memory_$Pointer$#2.base)| |v_chain_node_alloc_node_#res#1.base_59| (select |c_#memory_$Pointer$#2.base| |v_chain_node_alloc_node_#res#1.base_59|)) |c_#memory_$Pointer$#2.base|))) (exists ((|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_11|) 0))) is different from true [2024-11-19 20:44:25,399 INFO L378 Elim1Store]: Elim1 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 43 treesize of output 27 [2024-11-19 20:44:25,416 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-19 20:44:25,416 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 24 [2024-11-19 20:44:25,421 INFO L378 Elim1Store]: Elim1 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 15 [2024-11-19 20:44:25,425 INFO L378 Elim1Store]: Elim1 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 15 [2024-11-19 20:44:25,429 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:44:25,509 INFO L378 Elim1Store]: Elim1 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 3 [2024-11-19 20:44:25,513 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 3 [2024-11-19 20:44:25,516 INFO L378 Elim1Store]: Elim1 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 3 [2024-11-19 20:44:25,721 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_chain_node_alloc_node_#res#1.base_60| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |v_chain_node_alloc_node_#res#1.base_60| (select |c_#memory_$Pointer$#2.base| |v_chain_node_alloc_node_#res#1.base_60|)) |c_#memory_$Pointer$#2.base|) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_chain_node_alloc_node_#res#1.base_60| (select |c_#memory_$Pointer$#2.offset| |v_chain_node_alloc_node_#res#1.base_60|))) (= (select |c_old(#valid)| |v_chain_node_alloc_node_#res#1.base_60|) 0))) (exists ((|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_11|) 0))) is different from true [2024-11-19 20:44:25,751 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 20:44:25,751 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 15 [2024-11-19 20:44:25,758 INFO L378 Elim1Store]: Elim1 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 15 [2024-11-19 20:44:25,767 INFO L378 Elim1Store]: Elim1 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 15 [2024-11-19 20:44:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-19 20:44:26,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:44:26,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168761287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:44:26,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:44:26,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 34 [2024-11-19 20:44:26,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749265449] [2024-11-19 20:44:26,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:44:26,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-19 20:44:26,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:44:26,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-19 20:44:26,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1011, Unknown=2, NotChecked=130, Total=1260 [2024-11-19 20:44:26,290 INFO L87 Difference]: Start difference. First operand 179 states and 207 transitions. Second operand has 34 states, 29 states have (on average 2.586206896551724) internal successors, (75), 32 states have internal predecessors, (75), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:44:30,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:44:30,035 INFO L93 Difference]: Finished difference Result 299 states and 354 transitions. [2024-11-19 20:44:30,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-19 20:44:30,036 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 2.586206896551724) internal successors, (75), 32 states have internal predecessors, (75), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) Word has length 53 [2024-11-19 20:44:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:44:30,039 INFO L225 Difference]: With dead ends: 299 [2024-11-19 20:44:30,039 INFO L226 Difference]: Without dead ends: 296 [2024-11-19 20:44:30,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=369, Invalid=3059, Unknown=2, NotChecked=230, Total=3660 [2024-11-19 20:44:30,041 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 202 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 432 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 20:44:30,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 734 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1965 Invalid, 0 Unknown, 432 Unchecked, 1.6s Time] [2024-11-19 20:44:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-19 20:44:30,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 178. [2024-11-19 20:44:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 142 states have (on average 1.1619718309859155) internal successors, (165), 153 states have internal predecessors, (165), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (16), 12 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 20:44:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2024-11-19 20:44:30,076 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 53 [2024-11-19 20:44:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:44:30,076 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2024-11-19 20:44:30,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 2.586206896551724) internal successors, (75), 32 states have internal predecessors, (75), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:44:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2024-11-19 20:44:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 20:44:30,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:44:30,078 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:44:30,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 20:44:30,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:44:30,279 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:44:30,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:44:30,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1561123906, now seen corresponding path program 1 times [2024-11-19 20:44:30,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:44:30,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092145417] [2024-11-19 20:44:30,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:30,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:44:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:31,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:44:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:31,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:44:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:31,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:44:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:31,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 20:44:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:31,928 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 20:44:31,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:44:31,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092145417] [2024-11-19 20:44:31,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092145417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:44:31,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194416964] [2024-11-19 20:44:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:44:31,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:44:31,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:44:31,930 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) [2024-11-19 20:44:31,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 20:44:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:44:32,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-11-19 20:44:32,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:44:32,167 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 20:44:32,210 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:44:32,234 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 15 [2024-11-19 20:44:32,237 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-19 20:44:32,291 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 39 treesize of output 16 [2024-11-19 20:44:32,321 INFO L378 Elim1Store]: Elim1 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 37 treesize of output 25 [2024-11-19 20:44:32,325 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 20:44:32,327 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-19 20:44:32,330 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:44:32,338 INFO L378 Elim1Store]: Elim1 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 12 treesize of output 4 [2024-11-19 20:44:32,340 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 3 [2024-11-19 20:44:32,523 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 20:44:32,640 INFO L349 Elim1Store]: treesize reduction 44, result has 33.3 percent of original size [2024-11-19 20:44:32,641 INFO L378 Elim1Store]: Elim1 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 35 treesize of output 28 [2024-11-19 20:44:32,649 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 16 [2024-11-19 20:44:32,719 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 13 [2024-11-19 20:44:32,722 INFO L378 Elim1Store]: Elim1 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 12 treesize of output 4 [2024-11-19 20:44:32,725 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 3 [2024-11-19 20:44:32,897 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 16 [2024-11-19 20:44:32,905 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_21| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_21|) |v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_21|) 0)) (exists ((|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_20| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_20|) 0)) (exists ((|v_chain_node_alloc_node_#res#1.base_69| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_chain_node_alloc_node_#res#1.base_69|))) (and (= (select |c_old(#valid)| |v_chain_node_alloc_node_#res#1.base_69|) 0) (= (select .cse0 0) (select (select |c_old(#memory_$Pointer$#3.base)| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)) (= (store |c_old(#memory_$Pointer$#2.base)| |v_chain_node_alloc_node_#res#1.base_69| .cse0) |c_#memory_$Pointer$#2.base|))))) is different from true [2024-11-19 20:44:32,923 INFO L378 Elim1Store]: Elim1 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 32 treesize of output 20 [2024-11-19 20:44:32,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:44:32,930 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 16 [2024-11-19 20:44:32,939 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 20:44:32,939 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 20:44:33,086 INFO L378 Elim1Store]: Elim1 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 40 treesize of output 24 [2024-11-19 20:44:33,273 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-19 20:44:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-19 20:44:33,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:44:33,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:44:33,349 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 26 treesize of output 30 [2024-11-19 20:44:33,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194416964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:44:33,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:44:33,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 40 [2024-11-19 20:44:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556845724] [2024-11-19 20:44:33,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:44:33,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-19 20:44:33,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:44:33,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-19 20:44:33,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1441, Unknown=2, NotChecked=76, Total=1640 [2024-11-19 20:44:33,421 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand has 40 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 34 states have internal predecessors, (73), 8 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7)