./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 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_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ --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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:34:38,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:34:38,847 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 22:34:38,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:34:38,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:34:38,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:34:38,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:34:38,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:34:38,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:34:38,904 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:34:38,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:34:38,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:34:38,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:34:38,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:34:38,908 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:34:38,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:34:38,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:34:38,910 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:34:38,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:34:38,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:34:38,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:34:38,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:34:38,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:34:38,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:34:38,913 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:34:38,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:34:38,914 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:34:38,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:34:38,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:34:38,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:34:38,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:34:38,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:34:38,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:34:38,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:34:38,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:34:38,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:34:38,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:34:38,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:34:38,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:34:38,920 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:34:38,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:34:38,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:34:38,921 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_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/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_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2023-11-23 22:34:39,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:34:39,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:34:39,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:34:39,316 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:34:39,316 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:34:39,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2023-11-23 22:34:42,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:34:42,749 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:34:42,750 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2023-11-23 22:34:42,771 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/data/c4a40cf7f/093fd3aac1fe4adc98cd3dae65ae326b/FLAG46f3ef936 [2023-11-23 22:34:42,790 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/data/c4a40cf7f/093fd3aac1fe4adc98cd3dae65ae326b [2023-11-23 22:34:42,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:34:42,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:34:42,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:34:42,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:34:42,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:34:42,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:42" (1/1) ... [2023-11-23 22:34:42,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2265575e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:42, skipping insertion in model container [2023-11-23 22:34:42,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:42" (1/1) ... [2023-11-23 22:34:42,881 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:34:43,337 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_21279f3b-f291-4eec-b57b-99e289b01380/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2023-11-23 22:34:43,344 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:34:43,357 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:34:43,404 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_21279f3b-f291-4eec-b57b-99e289b01380/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2023-11-23 22:34:43,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:34:43,438 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:34:43,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43 WrapperNode [2023-11-23 22:34:43,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:34:43,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:34:43,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:34:43,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:34:43,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43" (1/1) ... [2023-11-23 22:34:43,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43" (1/1) ... [2023-11-23 22:34:43,492 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 156 [2023-11-23 22:34:43,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:34:43,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:34:43,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:34:43,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:34:43,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43" (1/1) ... [2023-11-23 22:34:43,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43" (1/1) ... [2023-11-23 22:34:43,525 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43" (1/1) ... [2023-11-23 22:34:43,559 INFO L189 HeapSplitter]: Split 35 memory accesses to 3 slices as follows [2, 22, 11] [2023-11-23 22:34:43,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43" (1/1) ... [2023-11-23 22:34:43,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43" (1/1) ... [2023-11-23 22:34:43,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43" (1/1) ... [2023-11-23 22:34:43,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43" (1/1) ... [2023-11-23 22:34:43,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43" (1/1) ... [2023-11-23 22:34:43,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43" (1/1) ... [2023-11-23 22:34:43,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:34:43,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:34:43,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:34:43,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:34:43,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43" (1/1) ... [2023-11-23 22:34:43,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:34:43,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:34:43,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:34:43,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:34:43,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 22:34:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 22:34:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 22:34:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 22:34:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 22:34:43,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 22:34:43,689 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-23 22:34:43,689 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-23 22:34:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 22:34:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:34:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 22:34:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 22:34:43,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 22:34:43,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 22:34:43,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 22:34:43,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 22:34:43,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 22:34:43,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:34:43,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 22:34:43,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 22:34:43,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 22:34:43,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:34:43,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 22:34:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 22:34:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:34:43,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:34:43,838 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:34:43,841 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:34:44,236 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:34:44,301 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:34:44,301 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-23 22:34:44,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:44 BoogieIcfgContainer [2023-11-23 22:34:44,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:34:44,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:34:44,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:34:44,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:34:44,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:34:42" (1/3) ... [2023-11-23 22:34:44,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fce519c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:44, skipping insertion in model container [2023-11-23 22:34:44,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:43" (2/3) ... [2023-11-23 22:34:44,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fce519c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:44, skipping insertion in model container [2023-11-23 22:34:44,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:44" (3/3) ... [2023-11-23 22:34:44,317 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2023-11-23 22:34:44,340 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:34:44,340 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 22:34:44,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:34:44,399 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;@3bfcf062, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:34:44,400 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 22:34:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 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-23 22:34:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 22:34:44,412 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:34:44,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:34:44,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:34:44,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:34:44,418 INFO L85 PathProgramCache]: Analyzing trace with hash -680816188, now seen corresponding path program 1 times [2023-11-23 22:34:44,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:34:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72511601] [2023-11-23 22:34:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:34:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:44,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:34:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:34:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 22:34:44,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:34:44,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72511601] [2023-11-23 22:34:44,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72511601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:34:44,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:34:44,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:34:44,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866281727] [2023-11-23 22:34:44,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:34:44,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:34:44,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:34:45,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:34:45,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:34:45,011 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 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 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 22:34:45,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:34:45,144 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2023-11-23 22:34:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:34:45,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-23 22:34:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:34:45,154 INFO L225 Difference]: With dead ends: 56 [2023-11-23 22:34:45,154 INFO L226 Difference]: Without dead ends: 25 [2023-11-23 22:34:45,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-23 22:34:45,164 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:34:45,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:34:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-23 22:34:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-23 22:34:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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-23 22:34:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2023-11-23 22:34:45,212 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 19 [2023-11-23 22:34:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:34:45,213 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2023-11-23 22:34:45,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 22:34:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2023-11-23 22:34:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 22:34:45,215 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:34:45,215 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:34:45,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:34:45,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:34:45,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:34:45,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1161558312, now seen corresponding path program 1 times [2023-11-23 22:34:45,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:34:45,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460189747] [2023-11-23 22:34:45,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:34:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:45,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:34:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:45,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:34:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 22:34:45,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:34:45,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460189747] [2023-11-23 22:34:45,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460189747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:34:45,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:34:45,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:34:45,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448318908] [2023-11-23 22:34:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:34:45,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:34:45,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:34:45,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:34:45,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:34:45,556 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 22:34:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:34:45,661 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2023-11-23 22:34:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:34:45,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-23 22:34:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:34:45,663 INFO L225 Difference]: With dead ends: 35 [2023-11-23 22:34:45,663 INFO L226 Difference]: Without dead ends: 28 [2023-11-23 22:34:45,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:34:45,665 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:34:45,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:34:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-23 22:34:45,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-11-23 22:34:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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-23 22:34:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-11-23 22:34:45,679 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 19 [2023-11-23 22:34:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:34:45,680 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-11-23 22:34:45,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 22:34:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-11-23 22:34:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 22:34:45,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:34:45,697 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:34:45,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:34:45,699 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:34:45,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:34:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash -112877035, now seen corresponding path program 1 times [2023-11-23 22:34:45,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:34:45,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426318243] [2023-11-23 22:34:45,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:45,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:34:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:45,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:34:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:45,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:34:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 22:34:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:34:45,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426318243] [2023-11-23 22:34:45,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426318243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:34:45,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:34:45,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:34:45,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22151745] [2023-11-23 22:34:45,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:34:46,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:34:46,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:34:46,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:34:46,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:34:46,001 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 22:34:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:34:46,123 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2023-11-23 22:34:46,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:34:46,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-11-23 22:34:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:34:46,126 INFO L225 Difference]: With dead ends: 47 [2023-11-23 22:34:46,127 INFO L226 Difference]: Without dead ends: 28 [2023-11-23 22:34:46,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-23 22:34:46,129 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:34:46,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:34:46,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-23 22:34:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-23 22:34:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-23 22:34:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2023-11-23 22:34:46,136 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 20 [2023-11-23 22:34:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:34:46,137 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-11-23 22:34:46,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 22:34:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2023-11-23 22:34:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 22:34:46,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:34:46,139 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:34:46,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:34:46,139 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:34:46,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:34:46,140 INFO L85 PathProgramCache]: Analyzing trace with hash 935091600, now seen corresponding path program 1 times [2023-11-23 22:34:46,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:34:46,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805759633] [2023-11-23 22:34:46,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:46,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:34:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:49,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:34:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:49,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:34:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:49,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:34:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 22:34:49,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:34:49,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805759633] [2023-11-23 22:34:49,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805759633] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:34:49,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284107379] [2023-11-23 22:34:49,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:49,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:34:49,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:34:49,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:34:49,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 22:34:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:50,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 129 conjunts are in the unsatisfiable core [2023-11-23 22:34:50,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:34:50,783 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-23 22:34:51,047 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-23 22:34:51,161 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 22:34:51,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-23 22:34:51,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-23 22:34:51,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 22:34:51,425 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 22:34:51,426 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 1 case distinctions, treesize of input 57 treesize of output 50 [2023-11-23 22:34:51,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-23 22:34:51,751 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-11-23 22:34:51,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 151 [2023-11-23 22:34:51,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:34:51,770 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 44 treesize of output 33 [2023-11-23 22:34:51,789 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 86 treesize of output 78 [2023-11-23 22:34:51,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 28 [2023-11-23 22:34:51,820 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 26 treesize of output 15 [2023-11-23 22:34:52,126 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-23 22:34:52,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-23 22:34:54,211 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse0))) (let ((.cse1 (select .cse3 0)) (.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|))) (and (not (= .cse0 .cse1)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= .cse1 (select .cse3 4)) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 4) .cse5) (not (= .cse0 .cse5)) (not (= .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))))))) is different from false [2023-11-23 22:34:54,216 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse0))) (let ((.cse1 (select .cse3 0)) (.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|))) (and (not (= .cse0 .cse1)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= .cse1 (select .cse3 4)) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 4) .cse5) (not (= .cse0 .cse5)) (not (= .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))))))) is different from true [2023-11-23 22:34:54,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 19 [2023-11-23 22:34:54,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2023-11-23 22:34:54,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-11-23 22:34:54,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-23 22:34:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:34:54,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:35:03,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284107379] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:35:03,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 22:35:03,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 41 [2023-11-23 22:35:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016692078] [2023-11-23 22:35:03,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 22:35:03,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-23 22:35:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:35:03,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-23 22:35:03,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1887, Unknown=37, NotChecked=88, Total=2162 [2023-11-23 22:35:03,707 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 31 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 22:35:06,525 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse3 (select .cse9 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (= (select .cse9 4) .cse3)) (.cse5 (not (= .cse2 .cse3))) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (and (= (select .cse0 0) 0) (not (= .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= (select |c_#valid| .cse3) 1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse2) 1) .cse4 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse5 (not (= .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse2))) (let ((.cse6 (select .cse8 0)) (.cse7 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|))) (and (not (= .cse2 .cse6)) (not (= .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse7 (select |c_#memory_$Pointer$#1.base| .cse7))) (= .cse6 (select .cse8 4)) (= .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))))) (and .cse4 .cse5 (not (= .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse1) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) .cse1))))))) is different from false [2023-11-23 22:35:06,528 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse3 (select .cse9 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (= (select .cse9 4) .cse3)) (.cse5 (not (= .cse2 .cse3))) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (and (= (select .cse0 0) 0) (not (= .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= (select |c_#valid| .cse3) 1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse2) 1) .cse4 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse5 (not (= .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse2))) (let ((.cse6 (select .cse8 0)) (.cse7 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|))) (and (not (= .cse2 .cse6)) (not (= .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse7 (select |c_#memory_$Pointer$#1.base| .cse7))) (= .cse6 (select .cse8 4)) (= .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))))) (and .cse4 .cse5 (not (= .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (not (= (select (select |c_#memory_$Pointer$#1.base| .cse1) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) .cse1))))))) is different from true [2023-11-23 22:35:09,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:35:09,138 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2023-11-23 22:35:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-23 22:35:09,141 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 31 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2023-11-23 22:35:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:35:09,143 INFO L225 Difference]: With dead ends: 69 [2023-11-23 22:35:09,143 INFO L226 Difference]: Without dead ends: 67 [2023-11-23 22:35:09,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=296, Invalid=3455, Unknown=39, NotChecked=242, Total=4032 [2023-11-23 22:35:09,147 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:35:09,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 383 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1243 Invalid, 0 Unknown, 131 Unchecked, 2.2s Time] [2023-11-23 22:35:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-23 22:35:09,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 33. [2023-11-23 22:35:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 22:35:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2023-11-23 22:35:09,160 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 28 [2023-11-23 22:35:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:35:09,160 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2023-11-23 22:35:09,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 31 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 22:35:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2023-11-23 22:35:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 22:35:09,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:35:09,162 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:35:09,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 22:35:09,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:35:09,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:35:09,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:35:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash 158692931, now seen corresponding path program 1 times [2023-11-23 22:35:09,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:35:09,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184482525] [2023-11-23 22:35:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:35:09,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:35:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:09,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:35:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:09,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:35:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:09,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:35:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:09,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 22:35:09,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:35:09,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184482525] [2023-11-23 22:35:09,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184482525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:35:09,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:35:09,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:35:09,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686098593] [2023-11-23 22:35:09,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:35:09,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:35:09,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:35:09,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:35:09,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:35:09,652 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 22:35:09,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:35:09,737 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2023-11-23 22:35:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:35:09,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-23 22:35:09,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:35:09,738 INFO L225 Difference]: With dead ends: 42 [2023-11-23 22:35:09,739 INFO L226 Difference]: Without dead ends: 32 [2023-11-23 22:35:09,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:35:09,740 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:35:09,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 64 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:35:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-23 22:35:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-23 22:35:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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-23 22:35:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2023-11-23 22:35:09,749 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 29 [2023-11-23 22:35:09,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:35:09,750 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2023-11-23 22:35:09,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 22:35:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2023-11-23 22:35:09,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 22:35:09,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:35:09,752 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:35:09,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:35:09,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:35:09,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:35:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash 458760797, now seen corresponding path program 2 times [2023-11-23 22:35:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:35:09,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048869791] [2023-11-23 22:35:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:35:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:35:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:09,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:35:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:09,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:35:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:35:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 22:35:10,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:35:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048869791] [2023-11-23 22:35:10,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048869791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:35:10,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:35:10,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:35:10,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642470119] [2023-11-23 22:35:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:35:10,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:35:10,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:35:10,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:35:10,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:35:10,004 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 22:35:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:35:10,108 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2023-11-23 22:35:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:35:10,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-23 22:35:10,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:35:10,110 INFO L225 Difference]: With dead ends: 41 [2023-11-23 22:35:10,110 INFO L226 Difference]: Without dead ends: 30 [2023-11-23 22:35:10,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:35:10,111 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 30 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:35:10,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 58 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:35:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-23 22:35:10,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-23 22:35:10,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-23 22:35:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-11-23 22:35:10,120 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 29 [2023-11-23 22:35:10,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:35:10,121 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-11-23 22:35:10,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 22:35:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-11-23 22:35:10,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-23 22:35:10,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:35:10,123 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:35:10,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 22:35:10,123 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:35:10,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:35:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash 976741128, now seen corresponding path program 1 times [2023-11-23 22:35:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:35:10,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330716297] [2023-11-23 22:35:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:35:10,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:35:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:11,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:35:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:11,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:35:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:11,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:35:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 22:35:11,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:35:11,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330716297] [2023-11-23 22:35:11,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330716297] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:35:11,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060318229] [2023-11-23 22:35:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:35:11,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:35:11,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:35:11,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:35:11,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21279f3b-f291-4eec-b57b-99e289b01380/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 22:35:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:11,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-23 22:35:11,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:35:11,585 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-23 22:35:11,756 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 22:35:11,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-23 22:35:11,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 22:35:11,870 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 22:35:11,871 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 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-23 22:35:12,006 INFO L349 Elim1Store]: treesize reduction 74, result has 12.9 percent of original size [2023-11-23 22:35:12,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 162 [2023-11-23 22:35:12,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 94 [2023-11-23 22:35:12,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 42 [2023-11-23 22:35:12,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:35:12,257 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 75 treesize of output 52 [2023-11-23 22:35:12,277 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-23 22:35:12,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-11-23 22:35:12,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:35:12,578 INFO L349 Elim1Store]: treesize reduction 281, result has 26.1 percent of original size [2023-11-23 22:35:12,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 133 treesize of output 123 [2023-11-23 22:35:12,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:35:12,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 64 [2023-11-23 22:35:12,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:35:12,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 64 [2023-11-23 22:35:12,943 INFO L349 Elim1Store]: treesize reduction 76, result has 46.9 percent of original size [2023-11-23 22:35:12,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 118 [2023-11-23 22:35:13,194 INFO L349 Elim1Store]: treesize reduction 186, result has 44.3 percent of original size [2023-11-23 22:35:13,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 217 [2023-11-23 22:35:13,378 INFO L349 Elim1Store]: treesize reduction 550, result has 15.5 percent of original size [2023-11-23 22:35:13,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 1122 treesize of output 980 [2023-11-23 22:35:13,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2023-11-23 22:35:13,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:35:13,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:35:13,776 INFO L349 Elim1Store]: treesize reduction 24, result has 58.6 percent of original size [2023-11-23 22:35:13,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 112 [2023-11-23 22:35:14,405 INFO L349 Elim1Store]: treesize reduction 52, result has 47.5 percent of original size [2023-11-23 22:35:14,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 245 treesize of output 212 [2023-11-23 22:35:15,976 INFO L349 Elim1Store]: treesize reduction 256, result has 43.7 percent of original size [2023-11-23 22:35:15,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1820 treesize of output 2082