./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 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx --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-527bcce [2023-11-21 20:59:07,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 20:59:07,521 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 20:59:07,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 20:59:07,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 20:59:07,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 20:59:07,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 20:59:07,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 20:59:07,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 20:59:07,582 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 20:59:07,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 20:59:07,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 20:59:07,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 20:59:07,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 20:59:07,585 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 20:59:07,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 20:59:07,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 20:59:07,586 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 20:59:07,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 20:59:07,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 20:59:07,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 20:59:07,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 20:59:07,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 20:59:07,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 20:59:07,590 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 20:59:07,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 20:59:07,590 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 20:59:07,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 20:59:07,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 20:59:07,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 20:59:07,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 20:59:07,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:59:07,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 20:59:07,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 20:59:07,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 20:59:07,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 20:59:07,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 20:59:07,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 20:59:07,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 20:59:07,594 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 20:59:07,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 20:59:07,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 20:59:07,595 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_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/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_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx 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-21 20:59:07,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 20:59:07,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 20:59:07,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 20:59:07,959 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 20:59:07,960 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 20:59:07,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2023-11-21 20:59:11,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 20:59:11,715 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 20:59:11,717 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2023-11-21 20:59:11,745 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/data/74e3d039e/9c3e02b230e744dd8cc7b1eb5ed9e234/FLAG23dd5f5c9 [2023-11-21 20:59:11,766 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/data/74e3d039e/9c3e02b230e744dd8cc7b1eb5ed9e234 [2023-11-21 20:59:11,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 20:59:11,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 20:59:11,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 20:59:11,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 20:59:11,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 20:59:11,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:59:11" (1/1) ... [2023-11-21 20:59:11,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43179f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:11, skipping insertion in model container [2023-11-21 20:59:11,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:59:11" (1/1) ... [2023-11-21 20:59:11,876 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 20:59:12,435 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_268e7af1-4590-4855-9057-5b4bd52d5dc4/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2023-11-21 20:59:12,444 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:59:12,459 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 20:59:12,541 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_268e7af1-4590-4855-9057-5b4bd52d5dc4/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2023-11-21 20:59:12,542 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:59:12,587 INFO L206 MainTranslator]: Completed translation [2023-11-21 20:59:12,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12 WrapperNode [2023-11-21 20:59:12,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 20:59:12,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 20:59:12,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 20:59:12,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 20:59:12,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12" (1/1) ... [2023-11-21 20:59:12,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12" (1/1) ... [2023-11-21 20:59:12,669 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 156 [2023-11-21 20:59:12,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 20:59:12,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 20:59:12,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 20:59:12,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 20:59:12,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12" (1/1) ... [2023-11-21 20:59:12,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12" (1/1) ... [2023-11-21 20:59:12,702 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12" (1/1) ... [2023-11-21 20:59:12,729 INFO L187 HeapSplitter]: Split 35 memory accesses to 3 slices as follows [2, 22, 11] [2023-11-21 20:59:12,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12" (1/1) ... [2023-11-21 20:59:12,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12" (1/1) ... [2023-11-21 20:59:12,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12" (1/1) ... [2023-11-21 20:59:12,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12" (1/1) ... [2023-11-21 20:59:12,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12" (1/1) ... [2023-11-21 20:59:12,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12" (1/1) ... [2023-11-21 20:59:12,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 20:59:12,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 20:59:12,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 20:59:12,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 20:59:12,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12" (1/1) ... [2023-11-21 20:59:12,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:59:12,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:59:12,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 20:59:12,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 20:59:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 20:59:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 20:59:12,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 20:59:12,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 20:59:12,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 20:59:12,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 20:59:12,855 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-21 20:59:12,855 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-21 20:59:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 20:59:12,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 20:59:12,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 20:59:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-21 20:59:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-21 20:59:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-21 20:59:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 20:59:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 20:59:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-21 20:59:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 20:59:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-21 20:59:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-21 20:59:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-21 20:59:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 20:59:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 20:59:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 20:59:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 20:59:12,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 20:59:13,026 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 20:59:13,028 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 20:59:13,404 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 20:59:13,598 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 20:59:13,598 INFO L308 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-21 20:59:13,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:59:13 BoogieIcfgContainer [2023-11-21 20:59:13,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 20:59:13,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 20:59:13,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 20:59:13,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 20:59:13,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:59:11" (1/3) ... [2023-11-21 20:59:13,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216936e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:59:13, skipping insertion in model container [2023-11-21 20:59:13,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:12" (2/3) ... [2023-11-21 20:59:13,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216936e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:59:13, skipping insertion in model container [2023-11-21 20:59:13,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:59:13" (3/3) ... [2023-11-21 20:59:13,615 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2023-11-21 20:59:13,636 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 20:59:13,636 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-21 20:59:13,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 20:59:13,710 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;@4dc67dcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:59:13,710 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 20:59:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-21 20:59:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-21 20:59:13,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:13,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:13,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:59:13,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1668693240, now seen corresponding path program 1 times [2023-11-21 20:59:13,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:13,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108596001] [2023-11-21 20:59:13,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:14,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 20:59:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:14,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 20:59:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:14,415 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-21 20:59:14,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:14,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108596001] [2023-11-21 20:59:14,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108596001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:14,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:14,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:59:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572299760] [2023-11-21 20:59:14,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:14,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:14,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:14,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:14,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:14,462 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-21 20:59:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:15,395 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2023-11-21 20:59:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:15,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 16 [2023-11-21 20:59:15,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:15,406 INFO L225 Difference]: With dead ends: 32 [2023-11-21 20:59:15,406 INFO L226 Difference]: Without dead ends: 18 [2023-11-21 20:59:15,410 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-21 20:59:15,415 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:15,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-21 20:59:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-21 20:59:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-21 20:59:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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-21 20:59:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-11-21 20:59:15,466 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 16 [2023-11-21 20:59:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:15,468 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-11-21 20:59:15,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-21 20:59:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-11-21 20:59:15,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-21 20:59:15,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:15,471 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:15,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 20:59:15,472 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:59:15,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:15,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1668679321, now seen corresponding path program 1 times [2023-11-21 20:59:15,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:15,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935367810] [2023-11-21 20:59:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:15,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 20:59:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 20:59:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,882 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-21 20:59:15,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:15,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935367810] [2023-11-21 20:59:15,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935367810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:15,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:15,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 20:59:15,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782507700] [2023-11-21 20:59:15,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:15,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 20:59:15,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:15,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 20:59:15,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 20:59:15,889 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-21 20:59:17,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:17,459 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2023-11-21 20:59:17,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 20:59:17,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 16 [2023-11-21 20:59:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:17,461 INFO L225 Difference]: With dead ends: 31 [2023-11-21 20:59:17,461 INFO L226 Difference]: Without dead ends: 19 [2023-11-21 20:59:17,462 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-21 20:59:17,464 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:17,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 36 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-21 20:59:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-21 20:59:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-21 20:59:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-21 20:59:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-11-21 20:59:17,474 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2023-11-21 20:59:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:17,474 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-11-21 20:59:17,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-21 20:59:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-11-21 20:59:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-21 20:59:17,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:17,477 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:17,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 20:59:17,478 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:59:17,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:17,479 INFO L85 PathProgramCache]: Analyzing trace with hash -906513271, now seen corresponding path program 1 times [2023-11-21 20:59:17,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:17,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271517368] [2023-11-21 20:59:17,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:17,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 20:59:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 20:59:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,927 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-21 20:59:17,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:17,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271517368] [2023-11-21 20:59:17,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271517368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:17,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:17,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:59:17,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323497424] [2023-11-21 20:59:17,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:17,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 20:59:17,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:17,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:59:17,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:59:17,934 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-21 20:59:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:19,546 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2023-11-21 20:59:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:59:19,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 22 [2023-11-21 20:59:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:19,548 INFO L225 Difference]: With dead ends: 26 [2023-11-21 20:59:19,548 INFO L226 Difference]: Without dead ends: 20 [2023-11-21 20:59:19,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:59:19,550 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:19,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 38 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-21 20:59:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-21 20:59:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-21 20:59:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-21 20:59:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-11-21 20:59:19,557 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 22 [2023-11-21 20:59:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:19,557 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-21 20:59:19,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-21 20:59:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-11-21 20:59:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-21 20:59:19,559 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:19,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:19,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 20:59:19,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:59:19,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1872857070, now seen corresponding path program 1 times [2023-11-21 20:59:19,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:19,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795505616] [2023-11-21 20:59:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:19,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:23,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 20:59:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:23,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 20:59:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:23,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:24,540 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-21 20:59:24,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:24,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795505616] [2023-11-21 20:59:24,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795505616] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:59:24,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607186842] [2023-11-21 20:59:24,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:24,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:59:24,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:59:24,544 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:59:24,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 20:59:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:26,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 147 conjunts are in the unsatisfiable core [2023-11-21 20:59:26,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:59:26,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 20:59:26,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-11-21 20:59:26,892 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-21 20:59:27,074 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 20:59:27,079 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 1 case distinctions, treesize of input 23 treesize of output 20 [2023-11-21 20:59:27,168 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 20:59:27,168 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-21 20:59:27,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:27,415 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 0 case distinctions, treesize of input 42 treesize of output 28 [2023-11-21 20:59:27,445 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 24 treesize of output 26 [2023-11-21 20:59:27,456 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 16 treesize of output 11 [2023-11-21 20:59:27,739 INFO L349 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2023-11-21 20:59:27,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 192 treesize of output 93 [2023-11-21 20:59:27,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:27,762 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 50 treesize of output 39 [2023-11-21 20:59:27,775 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-21 20:59:28,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:28,371 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-21 20:59:28,372 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 61 [2023-11-21 20:59:28,411 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-21 20:59:28,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-21 20:59:28,435 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 20 treesize of output 15 [2023-11-21 20:59:29,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 153 [2023-11-21 20:59:29,276 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 37 treesize of output 39 [2023-11-21 20:59:29,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:29,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:29,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:29,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2023-11-21 20:59:29,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:29,322 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 20:59:29,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 46 [2023-11-21 20:59:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:29,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:59:29,949 INFO L349 Elim1Store]: treesize reduction 48, result has 57.1 percent of original size [2023-11-21 20:59:29,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 312 treesize of output 427 [2023-11-21 20:59:30,420 INFO L349 Elim1Store]: treesize reduction 190, result has 5.0 percent of original size [2023-11-21 20:59:30,421 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 1555 treesize of output 1317 [2023-11-21 20:59:31,376 INFO L349 Elim1Store]: treesize reduction 388, result has 25.5 percent of original size [2023-11-21 20:59:31,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 207 treesize of output 712 [2023-11-21 20:59:32,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:32,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:32,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:32,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:32,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:32,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:32,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:32,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:32,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:59:32,635 INFO L224 Elim1Store]: Index analysis took 108 ms [2023-11-21 20:59:32,754 INFO L349 Elim1Store]: treesize reduction 156, result has 9.8 percent of original size [2023-11-21 20:59:32,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 17 case distinctions, treesize of input 129 treesize of output 234 [2023-11-21 20:59:37,530 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-11-21 20:59:37,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 13635 treesize of output 13217 [2023-11-21 20:59:41,288 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0)) (.cse0 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| 0))) (and (or (and .cse0 .cse1) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse2 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse4))) (and (or .cse2 (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_10 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_DerPreprocessor_10)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_29) .cse4 v_DerPreprocessor_30) .cse5) .cse6)))) (or (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_28 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_DerPreprocessor_11)) .cse4 v_DerPreprocessor_28) .cse5) .cse6))) (not .cse2)))))) (or (not .cse1) (let ((.cse9 (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|))) (let ((.cse7 (= .cse9 0))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_33) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) (not .cse7)) (or (and (= (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|) 0) .cse7) (let ((.cse8 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse9))) (and (or (not .cse8) (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse9 v_DerPreprocessor_34) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (or .cse8 (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_35) .cse9 v_DerPreprocessor_36) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))))))) (not .cse0)))) is different from false [2023-11-21 20:59:42,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607186842] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:59:42,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 20:59:42,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2023-11-21 20:59:42,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760674947] [2023-11-21 20:59:42,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 20:59:42,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-21 20:59:42,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:42,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-21 20:59:42,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1588, Unknown=17, NotChecked=80, Total=1806 [2023-11-21 20:59:42,253 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 39 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 20:59:55,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:55,978 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2023-11-21 20:59:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 20:59:55,979 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 23 [2023-11-21 20:59:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:55,982 INFO L225 Difference]: With dead ends: 44 [2023-11-21 20:59:55,982 INFO L226 Difference]: Without dead ends: 42 [2023-11-21 20:59:55,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=223, Invalid=2843, Unknown=18, NotChecked=108, Total=3192 [2023-11-21 20:59:55,986 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:55,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 184 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2023-11-21 20:59:55,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-21 20:59:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2023-11-21 20:59:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 20:59:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2023-11-21 20:59:56,003 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 23 [2023-11-21 20:59:56,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:56,004 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2023-11-21 20:59:56,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 20:59:56,004 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2023-11-21 20:59:56,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-21 20:59:56,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:56,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:56,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 20:59:56,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_268e7af1-4590-4855-9057-5b4bd52d5dc4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:59:56,221 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:59:56,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2133991721, now seen corresponding path program 2 times [2023-11-21 20:59:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:56,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470463537] [2023-11-21 20:59:56,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:56,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:56,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 20:59:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:56,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-21 20:59:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:56,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:56,582 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-21 20:59:56,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:56,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470463537] [2023-11-21 20:59:56,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470463537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:56,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:56,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 20:59:56,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591012438] [2023-11-21 20:59:56,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:56,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:59:56,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:56,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:59:56,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:59:56,587 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-21 20:59:57,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-21 20:59:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:57,895 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2023-11-21 20:59:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:59:57,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 24 [2023-11-21 20:59:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:57,897 INFO L225 Difference]: With dead ends: 39 [2023-11-21 20:59:57,898 INFO L226 Difference]: Without dead ends: 32 [2023-11-21 20:59:57,898 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-21 20:59:57,899 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:57,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 51 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-21 20:59:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-21 20:59:57,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-21 20:59:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 20:59:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-11-21 20:59:57,928 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 24 [2023-11-21 20:59:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:57,928 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-11-21 20:59:57,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-21 20:59:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-11-21 20:59:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-21 20:59:57,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:57,933 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] [2023-11-21 20:59:57,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 20:59:57,933 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:59:57,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:57,934 INFO L85 PathProgramCache]: Analyzing trace with hash 226225638, now seen corresponding path program 1 times [2023-11-21 20:59:57,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:57,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804004567] [2023-11-21 20:59:57,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:57,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat