./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:04:54,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:04:54,290 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:04:54,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:04:54,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:04:54,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:04:54,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:04:54,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:04:54,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:04:54,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:04:54,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:04:54,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:04:54,334 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:04:54,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:04:54,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:04:54,336 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:04:54,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:04:54,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:04:54,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:04:54,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:04:54,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:04:54,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:04:54,341 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:04:54,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:04:54,342 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:04:54,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:04:54,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:04:54,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:04:54,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:04:54,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:04:54,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:04:54,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:04:54,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:04:54,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:04:54,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:04:54,348 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:04:54,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:04:54,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:04:54,349 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:04:54,349 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_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/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_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2023-11-06 22:04:54,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:04:54,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:04:54,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:04:54,748 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:04:54,749 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:04:54,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/dll2c_append_equal.i [2023-11-06 22:04:57,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:04:58,318 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:04:58,319 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2023-11-06 22:04:58,337 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/data/425fa9001/72a1049911e7419d97e35f0d3e5c3432/FLAGd2db49771 [2023-11-06 22:04:58,352 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/data/425fa9001/72a1049911e7419d97e35f0d3e5c3432 [2023-11-06 22:04:58,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:04:58,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:04:58,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:04:58,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:04:58,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:04:58,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:04:58" (1/1) ... [2023-11-06 22:04:58,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36fdd032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58, skipping insertion in model container [2023-11-06 22:04:58,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:04:58" (1/1) ... [2023-11-06 22:04:58,431 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:04:58,801 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_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2023-11-06 22:04:58,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:04:58,819 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:04:58,866 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_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2023-11-06 22:04:58,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:04:58,899 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:04:58,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58 WrapperNode [2023-11-06 22:04:58,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:04:58,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:04:58,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:04:58,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:04:58,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58" (1/1) ... [2023-11-06 22:04:58,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58" (1/1) ... [2023-11-06 22:04:58,951 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2023-11-06 22:04:58,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:04:58,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:04:58,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:04:58,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:04:58,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58" (1/1) ... [2023-11-06 22:04:58,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58" (1/1) ... [2023-11-06 22:04:58,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58" (1/1) ... [2023-11-06 22:04:58,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58" (1/1) ... [2023-11-06 22:04:58,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58" (1/1) ... [2023-11-06 22:04:58,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58" (1/1) ... [2023-11-06 22:04:58,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58" (1/1) ... [2023-11-06 22:04:58,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58" (1/1) ... [2023-11-06 22:04:58,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:04:58,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:04:58,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:04:58,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:04:58,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58" (1/1) ... [2023-11-06 22:04:58,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:04:59,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:04:59,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:04:59,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:04:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:04:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:04:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 22:04:59,074 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 22:04:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:04:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:04:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:04:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:04:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:04:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:04:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:04:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:04:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:04:59,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:04:59,205 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:04:59,207 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:04:59,569 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:04:59,598 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:04:59,599 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 22:04:59,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:04:59 BoogieIcfgContainer [2023-11-06 22:04:59,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:04:59,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:04:59,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:04:59,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:04:59,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:04:58" (1/3) ... [2023-11-06 22:04:59,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fe8317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:04:59, skipping insertion in model container [2023-11-06 22:04:59,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:58" (2/3) ... [2023-11-06 22:04:59,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fe8317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:04:59, skipping insertion in model container [2023-11-06 22:04:59,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:04:59" (3/3) ... [2023-11-06 22:04:59,611 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2023-11-06 22:04:59,655 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:04:59,656 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:04:59,728 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:04:59,736 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4123ce0f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:04:59,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:04:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 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-06 22:04:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:04:59,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:04:59,756 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:59,757 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:04:59,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash 976010426, now seen corresponding path program 1 times [2023-11-06 22:04:59,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:59,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29590174] [2023-11-06 22:04:59,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:59,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:00,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:05:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:00,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:05:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:05:00,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:00,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29590174] [2023-11-06 22:05:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29590174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:00,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:00,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:05:00,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908042662] [2023-11-06 22:05:00,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:00,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:05:00,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:00,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:05:00,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:05:00,299 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 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 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-06 22:05:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:00,397 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2023-11-06 22:05:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:05:00,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 24 [2023-11-06 22:05:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:00,408 INFO L225 Difference]: With dead ends: 61 [2023-11-06 22:05:00,409 INFO L226 Difference]: Without dead ends: 27 [2023-11-06 22:05:00,412 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-06 22:05:00,416 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:00,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:05:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-06 22:05:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-06 22:05:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-06 22:05:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-11-06 22:05:00,459 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2023-11-06 22:05:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:00,461 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-06 22:05:00,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-06 22:05:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-11-06 22:05:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:05:00,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:00,464 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:00,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:05:00,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:00,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1442307826, now seen corresponding path program 1 times [2023-11-06 22:05:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:00,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035339798] [2023-11-06 22:05:00,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:00,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:05:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:05:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:05:00,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:00,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035339798] [2023-11-06 22:05:00,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035339798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:00,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:00,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:05:00,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560317146] [2023-11-06 22:05:00,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:00,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:05:00,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:05:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:05:00,854 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-06 22:05:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:00,965 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2023-11-06 22:05:00,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:05:00,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 24 [2023-11-06 22:05:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:00,968 INFO L225 Difference]: With dead ends: 50 [2023-11-06 22:05:00,969 INFO L226 Difference]: Without dead ends: 32 [2023-11-06 22:05:00,974 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-06 22:05:00,978 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:00,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:05:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-06 22:05:00,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-11-06 22:05:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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-06 22:05:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-06 22:05:00,998 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2023-11-06 22:05:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:00,998 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-06 22:05:00,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-06 22:05:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-06 22:05:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:05:01,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:01,003 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:01,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:05:01,004 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:01,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:01,005 INFO L85 PathProgramCache]: Analyzing trace with hash 915772386, now seen corresponding path program 1 times [2023-11-06 22:05:01,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:01,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768342263] [2023-11-06 22:05:01,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:01,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:01,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:05:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:05:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:01,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:05:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:05:02,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:02,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768342263] [2023-11-06 22:05:02,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768342263] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:05:02,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085824531] [2023-11-06 22:05:02,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:02,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:05:02,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:05:02,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:05:02,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:05:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-06 22:05:02,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:05:02,841 INFO L351 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 8 treesize of output 4 [2023-11-06 22:05:02,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:02,997 INFO L351 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 17 treesize of output 12 [2023-11-06 22:05:03,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-06 22:05:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:05:03,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:05:03,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085824531] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:05:03,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:05:03,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2023-11-06 22:05:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449086287] [2023-11-06 22:05:03,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:05:03,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 22:05:03,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:03,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 22:05:03,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=617, Unknown=2, NotChecked=0, Total=702 [2023-11-06 22:05:03,303 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:05:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:04,168 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2023-11-06 22:05:04,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:05:04,169 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2023-11-06 22:05:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:04,170 INFO L225 Difference]: With dead ends: 55 [2023-11-06 22:05:04,170 INFO L226 Difference]: Without dead ends: 32 [2023-11-06 22:05:04,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=1031, Unknown=2, NotChecked=0, Total=1190 [2023-11-06 22:05:04,172 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:04,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 229 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:05:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-06 22:05:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-11-06 22:05:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:05:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-06 22:05:04,181 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 34 [2023-11-06 22:05:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:04,182 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-06 22:05:04,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:05:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-11-06 22:05:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:05:04,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:04,184 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:04,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:05:04,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:05:04,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:04,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:04,405 INFO L85 PathProgramCache]: Analyzing trace with hash 917619428, now seen corresponding path program 1 times [2023-11-06 22:05:04,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:04,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579008777] [2023-11-06 22:05:04,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:04,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:05:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:05:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:05:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:05:10,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:10,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579008777] [2023-11-06 22:05:10,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579008777] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:05:10,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607827394] [2023-11-06 22:05:10,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:10,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:05:10,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:05:10,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:05:10,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:05:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:11,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 141 conjunts are in the unsatisfiable core [2023-11-06 22:05:11,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:05:11,300 INFO L351 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-06 22:05:11,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:05:11,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:11,568 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-11-06 22:05:11,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:11,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:05:11,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-11-06 22:05:11,912 INFO L351 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-06 22:05:12,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:12,075 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-06 22:05:12,076 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-06 22:05:12,252 INFO L351 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 23 treesize of output 11 [2023-11-06 22:05:12,274 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:05:12,504 INFO L351 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-06 22:05:12,520 INFO L351 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 23 treesize of output 16 [2023-11-06 22:05:13,005 INFO L322 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2023-11-06 22:05:13,006 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 129 [2023-11-06 22:05:13,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:13,029 INFO L351 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 28 treesize of output 25 [2023-11-06 22:05:13,036 INFO L351 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 18 treesize of output 11 [2023-11-06 22:05:13,060 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 70 [2023-11-06 22:05:13,572 INFO L322 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-11-06 22:05:13,572 INFO L351 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 94 [2023-11-06 22:05:13,590 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-06 22:05:13,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:13,602 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2023-11-06 22:05:13,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-11-06 22:05:13,618 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:05:13,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:13,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:13,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:13,993 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:05:13,994 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-06 22:05:14,220 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |c_#memory_$Pointer$.offset|))) (and (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse2 (select .cse4 0))) (and (= (select (select |c_#memory_int| .cse1) 8) 1) (not (= .cse2 .cse1)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (= .cse3 (select (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) .cse1 (store .cse3 4 .cse2)) .cse2)))) (= (select .cse4 4) .cse2) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) (not (= .cse2 0)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse7 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse7))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_#memory_$Pointer$.base|)) (.cse5 (select .cse8 0))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse5)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse6) (not (= .cse5 0)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse7)) (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse7) 8) 1) (= .cse5 (select .cse8 4)) (let ((.cse9 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse5))) (= .cse9 (select (store (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse5 v_DerPreprocessor_1) .cse7 (store .cse9 4 .cse5)) .cse5))) (= (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse6 (select |c_#memory_$Pointer$.base| .cse6)) |c_#memory_$Pointer$.base|) (not (= .cse5 .cse7)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-06 22:05:14,227 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |c_#memory_$Pointer$.offset|))) (and (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse2 (select .cse4 0))) (and (= (select (select |c_#memory_int| .cse1) 8) 1) (not (= .cse2 .cse1)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (= .cse3 (select (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) .cse1 (store .cse3 4 .cse2)) .cse2)))) (= (select .cse4 4) .cse2) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) (not (= .cse2 0)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse7 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse7))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_#memory_$Pointer$.base|)) (.cse5 (select .cse8 0))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse5)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse6) (not (= .cse5 0)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse7)) (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse7) 8) 1) (= .cse5 (select .cse8 4)) (let ((.cse9 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse5))) (= .cse9 (select (store (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse5 v_DerPreprocessor_1) .cse7 (store .cse9 4 .cse5)) .cse5))) (= (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse6 (select |c_#memory_$Pointer$.base| .cse6)) |c_#memory_$Pointer$.base|) (not (= .cse5 .cse7)))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-06 22:05:14,419 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select .cse3 0))) (and (= (select (select |c_#memory_int| .cse0) 8) 1) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)) (not (= .cse1 .cse0)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (= .cse2 (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) .cse0 (store .cse2 4 .cse1)) .cse1)))) (= (select .cse3 4) .cse1) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse4))) (let ((.cse5 (select .cse6 0)) (.cse8 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_#memory_$Pointer$.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse4)) (not (= .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= .cse5 0)) (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse4) 8) 1) (= .cse5 (select .cse6 4)) (let ((.cse7 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse5))) (= .cse7 (select (store (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse5 v_DerPreprocessor_1) .cse4 (store .cse7 4 .cse5)) .cse5))) (= (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse8 (select |c_#memory_$Pointer$.base| .cse8)) |c_#memory_$Pointer$.base|) (not (= .cse5 .cse4)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-06 22:05:14,424 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select .cse3 0))) (and (= (select (select |c_#memory_int| .cse0) 8) 1) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)) (not (= .cse1 .cse0)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (= .cse2 (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) .cse0 (store .cse2 4 .cse1)) .cse1)))) (= (select .cse3 4) .cse1) (<= (+ .cse1 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse4))) (let ((.cse5 (select .cse6 0)) (.cse8 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_#memory_$Pointer$.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse4)) (not (= .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= .cse5 0)) (<= (+ .cse5 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse4) 8) 1) (= .cse5 (select .cse6 4)) (let ((.cse7 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse5))) (= .cse7 (select (store (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse5 v_DerPreprocessor_1) .cse4 (store .cse7 4 .cse5)) .cse5))) (= (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse8 (select |c_#memory_$Pointer$.base| .cse8)) |c_#memory_$Pointer$.base|) (not (= .cse5 .cse4)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-06 22:05:15,540 INFO L322 Elim1Store]: treesize reduction 12067, result has 3.7 percent of original size [2023-11-06 22:05:15,541 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 7641 treesize of output 6129 [2023-11-06 22:05:15,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:15,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:15,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:15,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:15,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:15,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:15,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:15,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:15,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:15,746 INFO L322 Elim1Store]: treesize reduction 713, result has 4.6 percent of original size [2023-11-06 22:05:15,747 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 4734 treesize of output 4127 [2023-11-06 22:05:15,805 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3753 treesize of output 3569 [2023-11-06 22:05:15,861 INFO L351 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 19 treesize of output 7 [2023-11-06 22:05:16,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-06 22:05:16,714 INFO L351 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 150 treesize of output 146 [2023-11-06 22:05:16,976 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:05:17,175 INFO L351 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 9 treesize of output 5 [2023-11-06 22:05:17,580 INFO L351 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 595 treesize of output 583 [2023-11-06 22:05:20,604 INFO L351 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 304 treesize of output 154 [2023-11-06 22:05:20,697 INFO L351 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 304 treesize of output 154 [2023-11-06 22:05:20,998 INFO L351 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 304 treesize of output 154 [2023-11-06 22:05:21,151 INFO L351 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 304 treesize of output 154 [2023-11-06 22:05:21,383 INFO L351 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 304 treesize of output 154 [2023-11-06 22:05:21,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:21,565 INFO L322 Elim1Store]: treesize reduction 101, result has 12.2 percent of original size [2023-11-06 22:05:21,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 1089 treesize of output 641 [2023-11-06 22:05:21,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:21,597 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-06 22:05:21,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:05:21,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:05:21,801 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Unexpected substitution problem. at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-06 22:05:21,807 INFO L158 Benchmark]: Toolchain (without parser) took 23450.48ms. Allocated memory was 125.8MB in the beginning and 337.6MB in the end (delta: 211.8MB). Free memory was 93.7MB in the beginning and 166.6MB in the end (delta: -72.9MB). Peak memory consumption was 203.5MB. Max. memory is 16.1GB. [2023-11-06 22:05:21,807 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 98.6MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:05:21,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.49ms. Allocated memory is still 125.8MB. Free memory was 93.7MB in the beginning and 75.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:05:21,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.21ms. Allocated memory is still 125.8MB. Free memory was 75.9MB in the beginning and 73.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:05:21,808 INFO L158 Benchmark]: Boogie Preprocessor took 37.42ms. Allocated memory is still 125.8MB. Free memory was 73.5MB in the beginning and 71.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:05:21,809 INFO L158 Benchmark]: RCFGBuilder took 610.35ms. Allocated memory is still 125.8MB. Free memory was 71.8MB in the beginning and 96.8MB in the end (delta: -24.9MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2023-11-06 22:05:21,809 INFO L158 Benchmark]: TraceAbstraction took 22202.41ms. Allocated memory was 125.8MB in the beginning and 337.6MB in the end (delta: 211.8MB). Free memory was 96.1MB in the beginning and 166.6MB in the end (delta: -70.5MB). Peak memory consumption was 204.2MB. Max. memory is 16.1GB. [2023-11-06 22:05:21,811 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 98.6MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.49ms. Allocated memory is still 125.8MB. Free memory was 93.7MB in the beginning and 75.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.21ms. Allocated memory is still 125.8MB. Free memory was 75.9MB in the beginning and 73.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.42ms. Allocated memory is still 125.8MB. Free memory was 73.5MB in the beginning and 71.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 610.35ms. Allocated memory is still 125.8MB. Free memory was 71.8MB in the beginning and 96.8MB in the end (delta: -24.9MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22202.41ms. Allocated memory was 125.8MB in the beginning and 337.6MB in the end (delta: 211.8MB). Free memory was 96.1MB in the beginning and 166.6MB in the end (delta: -70.5MB). Peak memory consumption was 204.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Unexpected substitution problem. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Unexpected substitution problem.: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:305) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:05:21,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:05:24,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:05:24,725 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:05:24,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:05:24,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:05:24,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:05:24,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:05:24,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:05:24,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:05:24,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:05:24,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:05:24,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:05:24,807 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:05:24,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:05:24,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:05:24,811 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:05:24,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:05:24,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:05:24,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:05:24,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:05:24,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:05:24,815 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:05:24,816 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:05:24,816 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:05:24,817 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:05:24,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:05:24,818 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:05:24,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:05:24,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:05:24,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:05:24,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:05:24,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:05:24,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:05:24,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:05:24,823 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:05:24,823 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:05:24,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:05:24,824 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:05:24,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:05:24,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:05:24,825 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:05:24,826 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:05:24,826 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_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/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_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2023-11-06 22:05:25,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:05:25,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:05:25,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:05:25,402 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:05:25,403 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:05:25,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/dll2c_append_equal.i [2023-11-06 22:05:28,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:05:29,046 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:05:29,046 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2023-11-06 22:05:29,070 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/data/bf86668b6/0f5f9000cc9e458b8fd20c1dd13d409f/FLAG4bc524144 [2023-11-06 22:05:29,086 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/data/bf86668b6/0f5f9000cc9e458b8fd20c1dd13d409f [2023-11-06 22:05:29,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:05:29,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:05:29,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:05:29,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:05:29,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:05:29,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:05:29" (1/1) ... [2023-11-06 22:05:29,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e74bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29, skipping insertion in model container [2023-11-06 22:05:29,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:05:29" (1/1) ... [2023-11-06 22:05:29,175 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:05:29,597 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_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2023-11-06 22:05:29,602 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:05:29,621 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:05:29,706 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_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2023-11-06 22:05:29,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:05:29,758 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:05:29,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29 WrapperNode [2023-11-06 22:05:29,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:05:29,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:05:29,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:05:29,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:05:29,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29" (1/1) ... [2023-11-06 22:05:29,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29" (1/1) ... [2023-11-06 22:05:29,867 INFO L138 Inliner]: procedures = 130, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2023-11-06 22:05:29,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:05:29,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:05:29,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:05:29,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:05:29,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29" (1/1) ... [2023-11-06 22:05:29,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29" (1/1) ... [2023-11-06 22:05:29,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29" (1/1) ... [2023-11-06 22:05:29,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29" (1/1) ... [2023-11-06 22:05:29,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29" (1/1) ... [2023-11-06 22:05:29,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29" (1/1) ... [2023-11-06 22:05:29,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29" (1/1) ... [2023-11-06 22:05:29,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29" (1/1) ... [2023-11-06 22:05:29,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:05:29,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:05:29,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:05:29,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:05:29,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29" (1/1) ... [2023-11-06 22:05:29,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:05:29,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:05:29,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:05:29,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:05:30,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:05:30,017 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 22:05:30,017 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 22:05:30,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:05:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:05:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:05:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:05:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:05:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:05:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:05:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:05:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:05:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:05:30,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:05:30,171 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:05:30,174 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:05:31,116 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:05:31,123 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:05:31,123 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 22:05:31,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:05:31 BoogieIcfgContainer [2023-11-06 22:05:31,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:05:31,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:05:31,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:05:31,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:05:31,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:05:29" (1/3) ... [2023-11-06 22:05:31,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d036ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:05:31, skipping insertion in model container [2023-11-06 22:05:31,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:29" (2/3) ... [2023-11-06 22:05:31,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d036ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:05:31, skipping insertion in model container [2023-11-06 22:05:31,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:05:31" (3/3) ... [2023-11-06 22:05:31,134 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2023-11-06 22:05:31,169 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:05:31,169 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:05:31,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:05:31,229 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e990d5e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:05:31,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:05:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 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-06 22:05:31,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:05:31,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:31,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:31,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:31,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash 976010426, now seen corresponding path program 1 times [2023-11-06 22:05:31,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:05:31,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136091376] [2023-11-06 22:05:31,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:31,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:05:31,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:05:31,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:05:31,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:05:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:05:31,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:05:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:05:31,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:05:31,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:05:31,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136091376] [2023-11-06 22:05:31,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136091376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:31,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:31,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:05:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137619483] [2023-11-06 22:05:31,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:31,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:05:31,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:05:31,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:05:31,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:05:31,707 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 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 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-06 22:05:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:31,746 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2023-11-06 22:05:31,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:05:31,749 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 24 [2023-11-06 22:05:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:31,758 INFO L225 Difference]: With dead ends: 61 [2023-11-06 22:05:31,758 INFO L226 Difference]: Without dead ends: 27 [2023-11-06 22:05:31,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:05:31,768 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:31,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:05:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-06 22:05:31,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-06 22:05:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-06 22:05:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-11-06 22:05:31,817 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2023-11-06 22:05:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:31,819 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-06 22:05:31,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-06 22:05:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-11-06 22:05:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:05:31,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:31,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:31,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:05:32,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:05:32,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:32,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:32,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1442307826, now seen corresponding path program 1 times [2023-11-06 22:05:32,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:05:32,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962369602] [2023-11-06 22:05:32,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:32,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:05:32,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:05:32,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:05:32,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:05:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:32,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:05:32,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:05:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:05:32,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:05:32,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:05:32,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962369602] [2023-11-06 22:05:32,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962369602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:32,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:32,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:05:32,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723828743] [2023-11-06 22:05:32,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:32,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:05:32,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:05:32,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:05:32,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:05:32,375 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:05:32,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:32,397 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2023-11-06 22:05:32,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:05:32,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-11-06 22:05:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:32,399 INFO L225 Difference]: With dead ends: 50 [2023-11-06 22:05:32,400 INFO L226 Difference]: Without dead ends: 32 [2023-11-06 22:05:32,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-06 22:05:32,402 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:32,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:05:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-06 22:05:32,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-11-06 22:05:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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-06 22:05:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-06 22:05:32,412 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2023-11-06 22:05:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:32,412 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-06 22:05:32,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:05:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-06 22:05:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:05:32,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:32,415 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:32,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:05:32,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:05:32,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:32,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash 915772386, now seen corresponding path program 1 times [2023-11-06 22:05:32,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:05:32,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047703101] [2023-11-06 22:05:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:32,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:05:32,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:05:32,631 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:05:32,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:05:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:32,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:05:32,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:05:33,369 INFO L351 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 8 treesize of output 4 [2023-11-06 22:05:33,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:33,635 INFO L351 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 17 treesize of output 12 [2023-11-06 22:05:33,752 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-06 22:05:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:05:33,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:05:33,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:05:33,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047703101] [2023-11-06 22:05:33,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047703101] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:05:33,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [712330087] [2023-11-06 22:05:33,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:33,994 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 22:05:33,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 22:05:34,022 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 22:05:34,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-06 22:05:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:34,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-06 22:05:34,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:05:35,011 INFO L351 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-06 22:05:35,697 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2023-11-06 22:05:35,727 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-06 22:05:35,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:05:35,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:05:36,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:05:36,133 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_43| input size 23 context size 23 output size 23 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:330) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-06 22:05:36,138 INFO L158 Benchmark]: Toolchain (without parser) took 7042.94ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 60.5MB in the beginning and 87.8MB in the end (delta: -27.3MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2023-11-06 22:05:36,139 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 86.0MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:05:36,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 660.74ms. Allocated memory is still 86.0MB. Free memory was 60.3MB in the beginning and 41.5MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:05:36,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.87ms. Allocated memory is still 86.0MB. Free memory was 41.5MB in the beginning and 64.6MB in the end (delta: -23.0MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2023-11-06 22:05:36,140 INFO L158 Benchmark]: Boogie Preprocessor took 45.78ms. Allocated memory is still 86.0MB. Free memory was 64.6MB in the beginning and 62.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:05:36,141 INFO L158 Benchmark]: RCFGBuilder took 1210.44ms. Allocated memory is still 86.0MB. Free memory was 62.1MB in the beginning and 39.7MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:05:36,142 INFO L158 Benchmark]: TraceAbstraction took 5009.72ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 39.0MB in the beginning and 87.8MB in the end (delta: -48.8MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2023-11-06 22:05:36,145 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 86.0MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 660.74ms. Allocated memory is still 86.0MB. Free memory was 60.3MB in the beginning and 41.5MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.87ms. Allocated memory is still 86.0MB. Free memory was 41.5MB in the beginning and 64.6MB in the end (delta: -23.0MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.78ms. Allocated memory is still 86.0MB. Free memory was 64.6MB in the beginning and 62.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1210.44ms. Allocated memory is still 86.0MB. Free memory was 62.1MB in the beginning and 39.7MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5009.72ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 39.0MB in the beginning and 87.8MB in the end (delta: -48.8MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_43| input size 23 context size 23 output size 23 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_43| input size 23 context size 23 output size 23: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:330) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:05:36,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9219b707-b4a3-4f1b-8cf8-23bfe952a88e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_43| input size 23 context size 23 output size 23