./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/tree-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/tree-4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme --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 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:47:29,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:47:29,551 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:47:29,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:47:29,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:47:29,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:47:29,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:47:29,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:47:29,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:47:29,586 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:47:29,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:47:29,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:47:29,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:47:29,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:47:29,589 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:47:29,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:47:29,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:47:29,591 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:47:29,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:47:29,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:47:29,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:47:29,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:47:29,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:47:29,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:47:29,595 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:47:29,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:47:29,597 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:47:29,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:47:29,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:47:29,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:47:29,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:47:29,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:29,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:47:29,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:47:29,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:47:29,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:47:29,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:47:29,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:47:29,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:47:29,603 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:47:29,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:47:29,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:47:29,605 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme 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 -> 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e [2023-11-26 11:47:29,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:47:29,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:47:29,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:47:29,930 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:47:29,931 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:47:29,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/heap-manipulation/tree-4.i [2023-11-26 11:47:33,148 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:47:33,531 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:47:33,532 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/sv-benchmarks/c/heap-manipulation/tree-4.i [2023-11-26 11:47:33,557 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/data/8adae793d/ca9a7f65954543bfa9aa44fb4d0daec8/FLAG1a5af0d6f [2023-11-26 11:47:33,576 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/data/8adae793d/ca9a7f65954543bfa9aa44fb4d0daec8 [2023-11-26 11:47:33,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:47:33,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:47:33,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:33,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:47:33,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:47:33,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:33" (1/1) ... [2023-11-26 11:47:33,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c47997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:33, skipping insertion in model container [2023-11-26 11:47:33,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:33" (1/1) ... [2023-11-26 11:47:33,669 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:47:34,010 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/sv-benchmarks/c/heap-manipulation/tree-4.i[22626,22639] [2023-11-26 11:47:34,034 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:34,046 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:47:34,114 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/sv-benchmarks/c/heap-manipulation/tree-4.i[22626,22639] [2023-11-26 11:47:34,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:34,176 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:47:34,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34 WrapperNode [2023-11-26 11:47:34,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:34,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:34,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:47:34,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:47:34,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34" (1/1) ... [2023-11-26 11:47:34,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34" (1/1) ... [2023-11-26 11:47:34,236 INFO L138 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2023-11-26 11:47:34,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:34,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:47:34,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:47:34,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:47:34,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34" (1/1) ... [2023-11-26 11:47:34,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34" (1/1) ... [2023-11-26 11:47:34,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34" (1/1) ... [2023-11-26 11:47:34,278 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2023-11-26 11:47:34,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34" (1/1) ... [2023-11-26 11:47:34,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34" (1/1) ... [2023-11-26 11:47:34,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34" (1/1) ... [2023-11-26 11:47:34,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34" (1/1) ... [2023-11-26 11:47:34,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34" (1/1) ... [2023-11-26 11:47:34,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34" (1/1) ... [2023-11-26 11:47:34,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:47:34,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:47:34,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:47:34,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:47:34,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34" (1/1) ... [2023-11-26 11:47:34,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:34,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:34,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:47:34,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:47:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:47:34,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:47:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-26 11:47:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-26 11:47:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:47:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:47:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 11:47:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:47:34,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-26 11:47:34,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-26 11:47:34,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-26 11:47:34,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-26 11:47:34,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:47:34,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:47:34,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:47:34,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:47:34,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:47:34,627 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:47:34,630 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:47:34,965 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:47:34,989 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:47:34,990 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-26 11:47:34,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:34 BoogieIcfgContainer [2023-11-26 11:47:34,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:47:34,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:47:34,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:47:34,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:47:34,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:47:33" (1/3) ... [2023-11-26 11:47:35,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59980e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:34, skipping insertion in model container [2023-11-26 11:47:35,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:34" (2/3) ... [2023-11-26 11:47:35,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59980e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:35, skipping insertion in model container [2023-11-26 11:47:35,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:34" (3/3) ... [2023-11-26 11:47:35,002 INFO L112 eAbstractionObserver]: Analyzing ICFG tree-4.i [2023-11-26 11:47:35,024 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:47:35,024 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:47:35,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:47:35,088 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@68554a6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:47:35,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:47:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 39 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 11:47:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-26 11:47:35,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:35,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:35,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:35,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:35,111 INFO L85 PathProgramCache]: Analyzing trace with hash -199495174, now seen corresponding path program 1 times [2023-11-26 11:47:35,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:35,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107022913] [2023-11-26 11:47:35,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:35,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:47:35,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:35,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107022913] [2023-11-26 11:47:35,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107022913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:35,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:35,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:47:35,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428015439] [2023-11-26 11:47:35,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:35,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:47:35,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:35,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:47:35,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:47:35,351 INFO L87 Difference]: Start difference. First operand has 41 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 39 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:35,386 INFO L93 Difference]: Finished difference Result 80 states and 139 transitions. [2023-11-26 11:47:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:47:35,389 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-26 11:47:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:35,396 INFO L225 Difference]: With dead ends: 80 [2023-11-26 11:47:35,397 INFO L226 Difference]: Without dead ends: 29 [2023-11-26 11:47:35,400 INFO L412 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 [2023-11-26 11:47:35,404 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:35,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:47:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-26 11:47:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-26 11:47:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:35,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-11-26 11:47:35,454 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 9 [2023-11-26 11:47:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:35,454 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-11-26 11:47:35,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-11-26 11:47:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-26 11:47:35,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:35,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:35,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:47:35,458 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:35,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:35,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1653582785, now seen corresponding path program 1 times [2023-11-26 11:47:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:35,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174612970] [2023-11-26 11:47:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:35,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:47:35,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:35,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174612970] [2023-11-26 11:47:35,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174612970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:35,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:35,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:47:35,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899745518] [2023-11-26 11:47:35,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:35,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:47:35,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:35,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:47:35,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:35,585 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:35,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:35,646 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2023-11-26 11:47:35,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:47:35,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-26 11:47:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:35,649 INFO L225 Difference]: With dead ends: 54 [2023-11-26 11:47:35,649 INFO L226 Difference]: Without dead ends: 33 [2023-11-26 11:47:35,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:35,651 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:35,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:47:35,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-26 11:47:35,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-26 11:47:35,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2023-11-26 11:47:35,660 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 10 [2023-11-26 11:47:35,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:35,660 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2023-11-26 11:47:35,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:35,660 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2023-11-26 11:47:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-26 11:47:35,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:35,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:35,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:47:35,662 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:35,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:35,663 INFO L85 PathProgramCache]: Analyzing trace with hash -866377149, now seen corresponding path program 1 times [2023-11-26 11:47:35,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:35,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581678854] [2023-11-26 11:47:35,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:35,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:47:35,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:35,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581678854] [2023-11-26 11:47:35,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581678854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:35,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:35,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:47:35,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402252780] [2023-11-26 11:47:35,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:35,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:47:35,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:35,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:47:35,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:47:35,826 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:35,877 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2023-11-26 11:47:35,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:47:35,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-26 11:47:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:35,883 INFO L225 Difference]: With dead ends: 69 [2023-11-26 11:47:35,888 INFO L226 Difference]: Without dead ends: 36 [2023-11-26 11:47:35,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:47:35,891 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:35,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 93 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:47:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-26 11:47:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2023-11-26 11:47:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2023-11-26 11:47:35,906 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 10 [2023-11-26 11:47:35,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:35,906 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-11-26 11:47:35,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2023-11-26 11:47:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-26 11:47:35,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:35,910 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:35,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:47:35,911 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:35,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:35,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1819356600, now seen corresponding path program 1 times [2023-11-26 11:47:35,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:35,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101522776] [2023-11-26 11:47:35,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:35,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:47:36,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:36,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101522776] [2023-11-26 11:47:36,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101522776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:36,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:36,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:47:36,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603523044] [2023-11-26 11:47:36,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:36,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:47:36,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:36,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:47:36,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:36,104 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:36,162 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2023-11-26 11:47:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:47:36,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-26 11:47:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:36,164 INFO L225 Difference]: With dead ends: 56 [2023-11-26 11:47:36,164 INFO L226 Difference]: Without dead ends: 37 [2023-11-26 11:47:36,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:36,167 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:36,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 48 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:47:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-26 11:47:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2023-11-26 11:47:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-11-26 11:47:36,174 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 16 [2023-11-26 11:47:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:36,175 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-11-26 11:47:36,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-11-26 11:47:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-26 11:47:36,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:36,176 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:36,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:47:36,177 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:36,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:36,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1851390138, now seen corresponding path program 1 times [2023-11-26 11:47:36,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:36,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143849282] [2023-11-26 11:47:36,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:36,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:47:36,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:36,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143849282] [2023-11-26 11:47:36,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143849282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:36,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:36,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:47:36,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797703720] [2023-11-26 11:47:36,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:36,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:47:36,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:36,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:47:36,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:36,511 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:36,742 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2023-11-26 11:47:36,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:47:36,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-26 11:47:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:36,743 INFO L225 Difference]: With dead ends: 77 [2023-11-26 11:47:36,744 INFO L226 Difference]: Without dead ends: 48 [2023-11-26 11:47:36,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:47:36,746 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:36,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 74 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:47:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-26 11:47:36,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2023-11-26 11:47:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 2 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) [2023-11-26 11:47:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-11-26 11:47:36,754 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2023-11-26 11:47:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:36,755 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-11-26 11:47:36,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-11-26 11:47:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-26 11:47:36,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:36,757 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:36,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:47:36,757 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:36,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:36,758 INFO L85 PathProgramCache]: Analyzing trace with hash -902867402, now seen corresponding path program 1 times [2023-11-26 11:47:36,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:36,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044908241] [2023-11-26 11:47:36,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:36,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:47:37,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:37,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044908241] [2023-11-26 11:47:37,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044908241] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:47:37,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124979278] [2023-11-26 11:47:37,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:37,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:47:37,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:37,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:47:37,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:47:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:37,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-26 11:47:37,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:38,005 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 [2023-11-26 11:47:38,190 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-26 11:47:38,191 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 [2023-11-26 11:47:38,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-26 11:47:38,315 INFO L349 Elim1Store]: treesize reduction 215, result has 0.5 percent of original size [2023-11-26 11:47:38,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 1189 treesize of output 949 [2023-11-26 11:47:38,360 INFO L349 Elim1Store]: treesize reduction 389, result has 0.3 percent of original size [2023-11-26 11:47:38,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 1593 treesize of output 1336 [2023-11-26 11:47:38,392 INFO L349 Elim1Store]: treesize reduction 217, result has 0.5 percent of original size [2023-11-26 11:47:38,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 1243 treesize of output 903 [2023-11-26 11:47:38,426 INFO L349 Elim1Store]: treesize reduction 53, result has 8.6 percent of original size [2023-11-26 11:47:38,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1028 treesize of output 636 [2023-11-26 11:47:38,446 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 [2023-11-26 11:47:38,481 INFO L349 Elim1Store]: treesize reduction 217, result has 0.5 percent of original size [2023-11-26 11:47:38,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 1508 treesize of output 1094 [2023-11-26 11:47:38,508 INFO L349 Elim1Store]: treesize reduction 57, result has 1.7 percent of original size [2023-11-26 11:47:38,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1242 treesize of output 1 [2023-11-26 11:47:38,620 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 12 [2023-11-26 11:47:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:47:38,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:47:38,655 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 217 treesize of output 185 [2023-11-26 11:47:38,666 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_212 Int) (v_ArrVal_209 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_211 (Array Int Int))) (not (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) v_arrayElimCell_17 v_ArrVal_212))))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_208)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_211)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_209)) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset|) 0))) is different from false [2023-11-26 11:47:38,725 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2023-11-26 11:47:38,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 149 [2023-11-26 11:47:38,804 INFO L349 Elim1Store]: treesize reduction 54, result has 30.8 percent of original size [2023-11-26 11:47:38,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 2923 treesize of output 2482 [2023-11-26 11:47:39,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:39,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 10067 treesize of output 7619 [2023-11-26 11:47:39,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:39,807 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 6114 treesize of output 5685 [2023-11-26 11:47:39,982 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 5676 treesize of output 5630 [2023-11-26 11:47:40,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:40,184 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 5630 treesize of output 5435 [2023-11-26 11:47:42,811 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 8 treesize of output 6 [2023-11-26 11:47:43,031 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 6 treesize of output 4 [2023-11-26 11:47:43,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:43,042 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 35 treesize of output 39 [2023-11-26 11:47:43,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:43,076 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 41 treesize of output 45 [2023-11-26 11:47:43,098 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 6 treesize of output 4 [2023-11-26 11:47:43,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:43,107 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 36 treesize of output 34 [2023-11-26 11:47:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:47:43,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124979278] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:47:43,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:47:43,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-26 11:47:43,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372336259] [2023-11-26 11:47:43,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:47:43,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-26 11:47:43,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:43,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-26 11:47:43,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2023-11-26 11:47:43,299 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:43,848 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2023-11-26 11:47:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 11:47:43,849 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-26 11:47:43,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:43,858 INFO L225 Difference]: With dead ends: 78 [2023-11-26 11:47:43,859 INFO L226 Difference]: Without dead ends: 65 [2023-11-26 11:47:43,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=339, Unknown=1, NotChecked=38, Total=462 [2023-11-26 11:47:43,862 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 67 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:43,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 203 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 236 Invalid, 0 Unknown, 56 Unchecked, 0.4s Time] [2023-11-26 11:47:43,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-26 11:47:43,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2023-11-26 11:47:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 2 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) [2023-11-26 11:47:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-11-26 11:47:43,881 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2023-11-26 11:47:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:43,881 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-11-26 11:47:43,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-11-26 11:47:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-26 11:47:43,883 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:43,883 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:43,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-26 11:47:44,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-26 11:47:44,089 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:44,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:44,090 INFO L85 PathProgramCache]: Analyzing trace with hash -921952924, now seen corresponding path program 1 times [2023-11-26 11:47:44,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:44,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903952138] [2023-11-26 11:47:44,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:47:45,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:45,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903952138] [2023-11-26 11:47:45,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903952138] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:47:45,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709315240] [2023-11-26 11:47:45,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:45,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:47:45,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:45,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:47:45,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3264c9d-ece3-4c2d-b0b1-acbee0afa892/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:47:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:45,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-26 11:47:45,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:45,987 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 [2023-11-26 11:47:46,048 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 [2023-11-26 11:47:46,057 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 [2023-11-26 11:47:46,069 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-26 11:47:46,069 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 [2023-11-26 11:47:46,392 INFO L349 Elim1Store]: treesize reduction 216, result has 14.6 percent of original size [2023-11-26 11:47:46,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 3005 treesize of output 2271 [2023-11-26 11:47:46,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:47:46,432 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 369 treesize of output 312 [2023-11-26 11:47:46,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-11-26 11:47:46,512 INFO L349 Elim1Store]: treesize reduction 94, result has 32.9 percent of original size [2023-11-26 11:47:46,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 325 treesize of output 355 [2023-11-26 11:47:46,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 22 treesize of output 21 [2023-11-26 11:47:46,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2023-11-26 11:47:46,714 INFO L349 Elim1Store]: treesize reduction 873, result has 0.1 percent of original size [2023-11-26 11:47:46,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 16 new quantified variables, introduced 33 case distinctions, treesize of input 8176 treesize of output 7160 [2023-11-26 11:47:46,787 INFO L349 Elim1Store]: treesize reduction 873, result has 0.1 percent of original size [2023-11-26 11:47:46,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 16 new quantified variables, introduced 33 case distinctions, treesize of input 8493 treesize of output 7487 [2023-11-26 11:47:47,036 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_inspect_~node#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_inspect_~node#1.base|) 0) 0) (not (= |c_ULTIMATE.start_inspect_~node#1.base| .cse0)) (or (exists ((v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_9 0))) (and (= (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_9) (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_8) .cse0 v_DerPreprocessor_9)) (not (= .cse0 .cse1))))) (exists ((v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_9 0))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_9)) (.cse4 (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_8) .cse0 v_DerPreprocessor_9))) (and (= (select .cse2 .cse3) v_DerPreprocessor_9) (= .cse2 .cse4) (= (select .cse4 .cse3) v_DerPreprocessor_8)))))) (= |c_ULTIMATE.start_inspect_~node#1.offset| 0) (= 42 (select (select |c_#memory_int#1| .cse0) 12)))) is different from true [2023-11-26 11:47:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:47:47,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:47:47,430 INFO L349 Elim1Store]: treesize reduction 2321, result has 52.7 percent of original size [2023-11-26 11:47:47,430 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 8785 treesize of output 9563 [2023-11-26 11:47:47,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:47,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 9563 treesize of output 10218 [2023-11-26 11:47:47,540 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 3489 treesize of output 2972 [2023-11-26 11:47:47,679 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 134 treesize of output 4 [2023-11-26 11:47:47,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:47,889 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 1822 treesize of output 1823 [2023-11-26 11:47:47,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:47,926 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 2600 treesize of output 2600 [2023-11-26 11:47:48,149 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 134 treesize of output 4 [2023-11-26 11:47:48,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:47:48,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 11383 treesize of output 17460