./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:22:49,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:22:49,108 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 01:22:49,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:22:49,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:22:49,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:22:49,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:22:49,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:22:49,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:22:49,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:22:49,170 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:22:49,170 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:22:49,171 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:22:49,171 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:22:49,172 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:22:49,173 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:22:49,174 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:22:49,177 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:22:49,178 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:22:49,178 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:22:49,179 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:22:49,179 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:22:49,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:22:49,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:22:49,190 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:22:49,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:22:49,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:22:49,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:22:49,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:22:49,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:22:49,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:22:49,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:22:49,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:22:49,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:22:49,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:22:49,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:22:49,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:22:49,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:22:49,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:22:49,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:22:49,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:22:49,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:22:49,196 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:22:49,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:22:49,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:22:49,197 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:22:49,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:22:49,197 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/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_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c [2024-11-09 01:22:49,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:22:49,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:22:49,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:22:49,524 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:22:49,524 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:22:49,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/dll2n_insert_equal.i Unable to find full path for "g++" [2024-11-09 01:22:51,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:22:51,644 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:22:51,645 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2024-11-09 01:22:51,659 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/data/d046a3e4b/f9bb4c1ce3eb47ea9d66fa32882ad7a7/FLAGf5feb3b79 [2024-11-09 01:22:51,694 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/data/d046a3e4b/f9bb4c1ce3eb47ea9d66fa32882ad7a7 [2024-11-09 01:22:51,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:22:51,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:22:51,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:22:51,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:22:51,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:22:51,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:22:51" (1/1) ... [2024-11-09 01:22:51,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cda4efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:51, skipping insertion in model container [2024-11-09 01:22:51,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:22:51" (1/1) ... [2024-11-09 01:22:51,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:22:52,181 WARN L250 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_e71705e0-9305-4891-81fb-ec251f435e95/sv-benchmarks/c/list-simple/dll2n_insert_equal.i[24706,24719] [2024-11-09 01:22:52,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:22:52,198 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:22:52,267 WARN L250 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_e71705e0-9305-4891-81fb-ec251f435e95/sv-benchmarks/c/list-simple/dll2n_insert_equal.i[24706,24719] [2024-11-09 01:22:52,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:22:52,306 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:22:52,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:52 WrapperNode [2024-11-09 01:22:52,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:22:52,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:22:52,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:22:52,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:22:52,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:52" (1/1) ... [2024-11-09 01:22:52,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:52" (1/1) ... [2024-11-09 01:22:52,379 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 134 [2024-11-09 01:22:52,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:22:52,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:22:52,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:22:52,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:22:52,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:52" (1/1) ... [2024-11-09 01:22:52,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:52" (1/1) ... [2024-11-09 01:22:52,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:52" (1/1) ... [2024-11-09 01:22:52,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:52" (1/1) ... [2024-11-09 01:22:52,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:52" (1/1) ... [2024-11-09 01:22:52,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:52" (1/1) ... [2024-11-09 01:22:52,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:52" (1/1) ... [2024-11-09 01:22:52,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:52" (1/1) ... [2024-11-09 01:22:52,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:22:52,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:22:52,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:22:52,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:22:52,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:52" (1/1) ... [2024-11-09 01:22:52,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:22:52,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:22:52,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:22:52,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:22:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 01:22:52,482 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 01:22:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:22:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:22:52,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 01:22:52,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:22:52,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 01:22:52,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 01:22:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 01:22:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:22:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 01:22:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:22:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:22:52,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:22:52,718 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:22:52,721 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:22:52,766 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 01:22:53,037 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-09 01:22:53,037 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:22:53,159 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:22:53,160 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 01:22:53,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:22:53 BoogieIcfgContainer [2024-11-09 01:22:53,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:22:53,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:22:53,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:22:53,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:22:53,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:22:51" (1/3) ... [2024-11-09 01:22:53,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ce59ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:22:53, skipping insertion in model container [2024-11-09 01:22:53,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:52" (2/3) ... [2024-11-09 01:22:53,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ce59ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:22:53, skipping insertion in model container [2024-11-09 01:22:53,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:22:53" (3/3) ... [2024-11-09 01:22:53,175 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2024-11-09 01:22:53,195 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:22:53,195 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:22:53,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:22:53,261 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26010e73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:22:53,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:22:53,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:22:53,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 01:22:53,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:22:53,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:22:53,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:22:53,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:22:53,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1656223504, now seen corresponding path program 1 times [2024-11-09 01:22:53,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:22:53,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482283086] [2024-11-09 01:22:53,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:53,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:22:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:22:53,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:22:53,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482283086] [2024-11-09 01:22:53,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482283086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:22:53,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:22:53,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:22:53,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165291859] [2024-11-09 01:22:53,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:22:53,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:22:53,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:22:53,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:22:53,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:22:53,774 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:22:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:22:54,081 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2024-11-09 01:22:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:22:54,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 01:22:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:22:54,091 INFO L225 Difference]: With dead ends: 51 [2024-11-09 01:22:54,091 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 01:22:54,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:22:54,100 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:22:54,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:22:54,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 01:22:54,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-09 01:22:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:22:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-09 01:22:54,135 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 10 [2024-11-09 01:22:54,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:22:54,136 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-09 01:22:54,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:22:54,136 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-11-09 01:22:54,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 01:22:54,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:22:54,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:22:54,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:22:54,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:22:54,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:22:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1633066503, now seen corresponding path program 1 times [2024-11-09 01:22:54,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:22:54,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688505261] [2024-11-09 01:22:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:22:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:22:54,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:22:54,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688505261] [2024-11-09 01:22:54,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688505261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:22:54,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:22:54,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:22:54,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696172529] [2024-11-09 01:22:54,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:22:54,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:22:54,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:22:54,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:22:54,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:22:54,786 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:22:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:22:55,283 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2024-11-09 01:22:55,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:22:55,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 01:22:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:22:55,284 INFO L225 Difference]: With dead ends: 27 [2024-11-09 01:22:55,284 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 01:22:55,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:22:55,286 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:22:55,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:22:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 01:22:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 01:22:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:22:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-11-09 01:22:55,291 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 14 [2024-11-09 01:22:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:22:55,292 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-11-09 01:22:55,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:22:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-11-09 01:22:55,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 01:22:55,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:22:55,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:22:55,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:22:55,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:22:55,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:22:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash 914177237, now seen corresponding path program 1 times [2024-11-09 01:22:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:22:55,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311685288] [2024-11-09 01:22:55,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:22:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:22:55,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:22:55,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311685288] [2024-11-09 01:22:55,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311685288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:22:55,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469004077] [2024-11-09 01:22:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:55,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:22:55,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:22:55,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:22:55,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:22:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:55,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:22:55,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:22:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:22:55,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:22:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:22:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469004077] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:22:55,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [249190677] [2024-11-09 01:22:55,792 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 01:22:55,792 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:22:55,795 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:22:55,800 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:22:55,801 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:22:57,598 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:23:08,450 WARN L286 SmtUtils]: Spent 10.64s on a formula simplification. DAG size of input: 220 DAG size of output: 220 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:23:29,765 WARN L286 SmtUtils]: Spent 9.64s on a formula simplification. DAG size of input: 220 DAG size of output: 219 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:23:29,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [249190677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:29,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:23:29,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 9 [2024-11-09 01:23:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037271352] [2024-11-09 01:23:29,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:29,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:23:29,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:23:29,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:23:29,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=67, Unknown=3, NotChecked=0, Total=90 [2024-11-09 01:23:29,771 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:39,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:23:41,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:23:44,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:23:47,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:23:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:51,277 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2024-11-09 01:23:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:23:51,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 01:23:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:51,279 INFO L225 Difference]: With dead ends: 38 [2024-11-09 01:23:51,279 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 01:23:51,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=25, Invalid=80, Unknown=5, NotChecked=0, Total=110 [2024-11-09 01:23:51,281 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:51,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 5 Unknown, 0 Unchecked, 13.7s Time] [2024-11-09 01:23:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 01:23:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-09 01:23:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-09 01:23:51,290 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2024-11-09 01:23:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:51,290 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-09 01:23:51,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-09 01:23:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 01:23:51,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:51,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:23:51,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:23:51,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:23:51,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:51,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:51,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1717053324, now seen corresponding path program 1 times [2024-11-09 01:23:51,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:23:51,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664401892] [2024-11-09 01:23:51,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:51,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:23:51,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:23:51,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664401892] [2024-11-09 01:23:51,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664401892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:23:51,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612420302] [2024-11-09 01:23:51,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:51,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:23:51,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:23:51,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:23:51,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:23:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:51,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:23:51,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:23:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:23:51,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:23:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:23:51,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612420302] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:23:51,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1860642296] [2024-11-09 01:23:51,864 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 01:23:51,864 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:23:51,866 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:23:51,866 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:23:51,866 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:23:55,548 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:24:07,986 WARN L286 SmtUtils]: Spent 12.25s on a formula simplification. DAG size of input: 220 DAG size of output: 220 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:24:36,595 WARN L286 SmtUtils]: Spent 15.27s on a formula simplification. DAG size of input: 235 DAG size of output: 232 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:24:50,035 WARN L286 SmtUtils]: Spent 8.88s on a formula simplification. DAG size of input: 221 DAG size of output: 219 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:24:56,596 WARN L286 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 224 DAG size of output: 222 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:26:31,737 WARN L286 SmtUtils]: Spent 1.36m on a formula simplification. DAG size of input: 365 DAG size of output: 284 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:26:31,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1860642296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:31,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:26:31,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [3, 3, 3] total 12 [2024-11-09 01:26:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260756922] [2024-11-09 01:26:31,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:31,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:26:31,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:26:31,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:26:31,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=123, Unknown=7, NotChecked=0, Total=156 [2024-11-09 01:26:31,743 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:26:42,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:45,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:48,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:50,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:54,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:00,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:03,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:05,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:06,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:08,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:09,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:11,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:13,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:15,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:26,732 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2024-11-09 01:27:26,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:27:26,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 01:27:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:26,734 INFO L225 Difference]: With dead ends: 29 [2024-11-09 01:27:26,734 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 01:27:26,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 165.3s TimeCoverageRelationStatistics Valid=31, Invalid=142, Unknown=9, NotChecked=0, Total=182 [2024-11-09 01:27:26,735 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:26,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 31 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 8 Unknown, 0 Unchecked, 45.9s Time] [2024-11-09 01:27:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 01:27:26,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-09 01:27:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-09 01:27:26,746 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 16 [2024-11-09 01:27:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:26,746 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-09 01:27:26,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:27:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-09 01:27:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 01:27:26,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:26,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:26,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:27:26,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:26,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:26,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1689414214, now seen corresponding path program 1 times [2024-11-09 01:27:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:27:26,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745282759] [2024-11-09 01:27:26,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:27:27,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:27:27,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745282759] [2024-11-09 01:27:27,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745282759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:27,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749811186] [2024-11-09 01:27:27,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:27,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:27,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:27,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:27,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:27:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:27,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:27:27,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:27:27,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:27:27,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749811186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2027570233] [2024-11-09 01:27:27,323 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 01:27:27,325 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:27:27,325 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:27:27,326 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:27:27,326 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:27:32,748 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:27:44,952 WARN L286 SmtUtils]: Spent 11.92s on a formula simplification. DAG size of input: 220 DAG size of output: 220 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:28:28,788 WARN L286 SmtUtils]: Spent 28.75s on a formula simplification. DAG size of input: 235 DAG size of output: 232 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:28:40,806 WARN L286 SmtUtils]: Spent 7.27s on a formula simplification. DAG size of input: 221 DAG size of output: 219 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:28:49,808 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 224 DAG size of output: 222 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:30:57,268 WARN L286 SmtUtils]: Spent 1.82m on a formula simplification. DAG size of input: 365 DAG size of output: 284 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:33:28,218 WARN L286 SmtUtils]: Spent 2.18m on a formula simplification. DAG size of input: 370 DAG size of output: 284 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:36:03,772 WARN L286 SmtUtils]: Spent 2.23m on a formula simplification. DAG size of input: 379 DAG size of output: 293 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:36:03,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2027570233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:03,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:36:03,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [3, 3, 3] total 14 [2024-11-09 01:36:03,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369247336] [2024-11-09 01:36:03,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:03,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:36:03,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:36:03,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:36:03,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=165, Unknown=15, NotChecked=0, Total=210 [2024-11-09 01:36:03,775 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:36:14,148 WARN L286 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 235 DAG size of output: 146 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:36:18,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:23,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:36,790 WARN L286 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 232 DAG size of output: 224 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:36:39,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:41,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:44,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:45,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:47,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:48,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:50,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:52,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:36:54,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:37:01,663 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_insert_#t~mem11#1.base_29| Int) (|v_#memory_int_96| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.base_34| Int) (|v_#memory_int_97| (Array Int (Array Int Int))) (|v_#memory_int_98| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_65| (Array Int (Array Int Int))) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.base_17| Int) (|v_#memory_int_38| (Array Int (Array Int Int))) (|v_#length_32| (Array Int Int)) (|v_#memory_int_39| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_29| Int) (|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.base_16| Int) (|v_#memory_int_200| (Array Int (Array Int Int))) (|v_#memory_int_201| (Array Int (Array Int Int))) (|v_#valid_38| (Array Int Int)) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.base_33| Int) (|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_#memory_int_202| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.base_12| Int) (|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_17| Int) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_33| Int) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_34| Int) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_16| Int) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_12| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_36| Int) (|v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| Int) (|v_#memory_$Pointer$.base_116| (Array Int (Array Int Int))) (|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_112| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_112| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |v_#memory_$Pointer$.offset_117| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse6 (select (select |v_#memory_$Pointer$.base_117| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |v_#memory_$Pointer$.offset_117| .cse6)) (.cse8 (+ .cse4 4)) (.cse11 (select (select |v_#memory_$Pointer$.base_116| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse28 (select |v_#memory_$Pointer$.offset_65| .cse11)) (.cse13 (store (store |v_#valid_38| |c_ULTIMATE.start_main_~#s~0#1.base| 1) |v_ULTIMATE.start_dll_create_~head~0#1.base_36| 1)) (.cse23 (select |v_#memory_$Pointer$.base_117| .cse6)) (.cse5 (select .cse7 .cse8))) (let ((.cse14 (select |v_#memory_int_79| .cse11)) (.cse17 (select |v_#memory_int_38| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|)) (.cse16 (select |v_#memory_int_39| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|)) (.cse1 (+ .cse5 8)) (.cse0 (select .cse23 .cse8)) (.cse20 (store .cse13 .cse11 1)) (.cse18 (let ((.cse30 (store |v_#memory_$Pointer$.offset_65| .cse11 (store (store .cse28 4 0) 8 0)))) (store .cse30 |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (select .cse30 |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 8 0)))) (.cse24 (select |v_#memory_int_201| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|)) (.cse25 (select |v_#memory_int_198| 1)) (.cse15 (select |v_#memory_int_98| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|)) (.cse9 (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|)) (.cse12 (select |v_#memory_$Pointer$.base_65| .cse11)) (.cse26 (select |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|))) (and (= |c_#memory_int| (store |v_#memory_int_96| .cse0 (store (select |v_#memory_int_96| .cse0) .cse1 (select (select |c_#memory_int| .cse0) .cse1)))) (= (select |v_#length_32| 1) 2) (<= (+ |v_ULTIMATE.start_dll_create_~head~0#1.base_36| 1) |c_#StackHeapBarrier|) (= (let ((.cse2 (let ((.cse3 (store |v_#memory_$Pointer$.offset_117| .cse6 (store .cse7 .cse8 0)))) (store .cse3 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store (store (select .cse3 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 8 .cse4) 4 .cse5))))) (store .cse2 .cse0 (store (select .cse2 .cse0) .cse1 0))) |c_#memory_$Pointer$.offset|) (= (select |v_#valid_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 0) (= |v_ULTIMATE.start_dll_insert_#t~mem12#1.base_34| |v_ULTIMATE.start_dll_insert_#t~mem12#1.base_17|) (= (select |v_#valid_38| 0) 0) (= (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store (store (store (select |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_117| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 0))) |v_#memory_$Pointer$.base_117|) (= (store |v_#memory_$Pointer$.offset_112| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (select |v_#memory_$Pointer$.offset_112| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 0 (select .cse9 0))) |v_#memory_$Pointer$.offset_115|) (= |v_#memory_$Pointer$.base_116| (let ((.cse10 (store |v_#memory_$Pointer$.base_65| .cse11 (store (store .cse12 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 8 0)))) (store .cse10 |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (select .cse10 |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 8 .cse11)))) (= (select |v_#valid_38| 2) 1) (= (select |v_#valid_38| 1) 1) (= |v_ULTIMATE.start_dll_insert_#t~mem11#1.base_12| |v_ULTIMATE.start_dll_insert_#t~mem11#1.base_29|) (<= (+ .cse11 1) |c_#StackHeapBarrier|) (<= (+ |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| 1) |c_#StackHeapBarrier|) (= (select .cse13 .cse11) 0) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_36|)) (= (store (store (store (store |v_#length_32| |c_ULTIMATE.start_main_~#s~0#1.base| 4) |v_ULTIMATE.start_dll_create_~head~0#1.base_36| 12) .cse11 12) |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| 12) |c_#length|) (= (store |v_#memory_int_78| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (select |v_#memory_int_78| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 8 (select (select |v_#memory_int_202| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 8))) |v_#memory_int_202|) (= |v_#memory_int_78| (store |v_#memory_int_79| .cse11 (store .cse14 8 (select (select |v_#memory_int_78| .cse11) 8)))) (= |v_#memory_int_96| (store |v_#memory_int_98| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store .cse15 4 (select (select |v_#memory_int_96| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 4)))) (= (store |v_#memory_int_39| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store .cse16 8 (select .cse17 8))) |v_#memory_int_38|) (= |v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_34| |v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_17|) (= (select |v_#length_32| 2) 21) (= |v_#memory_int_79| (store |v_#memory_int_200| .cse11 (store (store (select |v_#memory_int_200| .cse11) 0 1) 4 (select .cse14 4)))) (= (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_#memory_int_97| (let ((.cse19 (store |v_#memory_int_38| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store .cse17 0 1)))) (store .cse19 .cse6 (store (select .cse19 .cse6) .cse8 (select (select |v_#memory_int_97| .cse6) .cse8))))) (= |v_#memory_int_39| (store |v_#memory_int_202| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store (select |v_#memory_int_202| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 4 (select .cse16 4)))) (= |c_#valid| (store .cse20 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| 1)) (= |c_#memory_$Pointer$.base| (let ((.cse21 (let ((.cse22 (store |v_#memory_$Pointer$.base_117| .cse6 (store .cse23 .cse8 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|)))) (store .cse22 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store (store (select .cse22 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 8 .cse6) 4 .cse0))))) (store .cse21 .cse0 (store (select .cse21 .cse0) .cse1 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|)))) (= (store |v_#memory_int_198| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (store (select |v_#memory_int_198| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 0 1) 4 (select .cse24 4))) |v_#memory_int_201|) (= (select .cse25 0) 48) (= (select .cse20 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 0) (= |v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_33| |v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_16|) (= |v_#memory_$Pointer$.offset_117| (store .cse18 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store (store (store (select .cse18 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 0)))) (= (store |v_#memory_int_201| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store .cse24 8 (select (select |v_#memory_int_200| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 8))) |v_#memory_int_200|) (= (select .cse25 1) 0) (= |v_ULTIMATE.start_dll_insert_#t~mem13#1.base_33| |v_ULTIMATE.start_dll_insert_#t~mem13#1.base_16|) (= (store |v_#memory_int_97| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store (select |v_#memory_int_97| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 8 (select .cse15 8))) |v_#memory_int_98|) (= (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 0 (select .cse26 0))) |v_#memory_$Pointer$.base_115|) (= |v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_12| |v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_29|) (= |v_#memory_$Pointer$.offset_65| (let ((.cse27 (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (store .cse9 4 0) 8 0)))) (store .cse27 .cse11 (store (select .cse27 .cse11) 0 (select .cse28 0))))) (= (let ((.cse29 (store |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (store .cse26 4 0) 8 0)))) (store .cse29 .cse11 (store (select .cse29 .cse11) 0 (select .cse12 0)))) |v_#memory_$Pointer$.base_65|) (not (= |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| 0)) (= (select |v_#valid_38| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~count~0#1| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_ULTIMATE.start_dll_insert_#t~mem11#1.base_29| Int) (|v_#memory_int_96| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.base_34| Int) (|v_#memory_int_97| (Array Int (Array Int Int))) (|v_#memory_int_98| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_65| (Array Int (Array Int Int))) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.base_17| Int) (|v_#memory_int_38| (Array Int (Array Int Int))) (|v_#length_32| (Array Int Int)) (|v_#memory_int_39| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_29| Int) (|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.base_16| Int) (|v_#memory_int_200| (Array Int (Array Int Int))) (|v_#memory_int_201| (Array Int (Array Int Int))) (|v_#valid_38| (Array Int Int)) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.base_33| Int) (|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_#memory_int_202| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.base_12| Int) (|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_17| Int) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_33| Int) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_34| Int) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_16| Int) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_12| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_36| Int) (|v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| Int) (|v_#memory_$Pointer$.base_116| (Array Int (Array Int Int))) (|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_112| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_112| (Array Int (Array Int Int)))) (let ((.cse35 (select (select |v_#memory_$Pointer$.offset_117| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse37 (select (select |v_#memory_$Pointer$.base_117| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse38 (select |v_#memory_$Pointer$.offset_117| .cse37)) (.cse39 (+ .cse35 4)) (.cse42 (select (select |v_#memory_$Pointer$.base_116| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse59 (select |v_#memory_$Pointer$.offset_65| .cse42)) (.cse44 (store (store |v_#valid_38| |c_ULTIMATE.start_main_~#s~0#1.base| 1) |v_ULTIMATE.start_dll_create_~head~0#1.base_36| 1)) (.cse54 (select |v_#memory_$Pointer$.base_117| .cse37)) (.cse36 (select .cse38 .cse39))) (let ((.cse45 (select |v_#memory_int_79| .cse42)) (.cse48 (select |v_#memory_int_38| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|)) (.cse47 (select |v_#memory_int_39| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|)) (.cse32 (+ .cse36 8)) (.cse31 (select .cse54 .cse39)) (.cse51 (store .cse44 .cse42 1)) (.cse49 (let ((.cse61 (store |v_#memory_$Pointer$.offset_65| .cse42 (store (store .cse59 4 0) 8 0)))) (store .cse61 |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (select .cse61 |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 8 0)))) (.cse55 (select |v_#memory_int_201| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|)) (.cse56 (select |v_#memory_int_198| 1)) (.cse46 (select |v_#memory_int_98| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|)) (.cse40 (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|)) (.cse43 (select |v_#memory_$Pointer$.base_65| .cse42)) (.cse57 (select |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|))) (and (= |c_#memory_int| (store |v_#memory_int_96| .cse31 (store (select |v_#memory_int_96| .cse31) .cse32 (select (select |c_#memory_int| .cse31) .cse32)))) (= (select |v_#length_32| 1) 2) (<= (+ |v_ULTIMATE.start_dll_create_~head~0#1.base_36| 1) |c_#StackHeapBarrier|) (= (let ((.cse33 (let ((.cse34 (store |v_#memory_$Pointer$.offset_117| .cse37 (store .cse38 .cse39 0)))) (store .cse34 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store (store (select .cse34 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 8 .cse35) 4 .cse36))))) (store .cse33 .cse31 (store (select .cse33 .cse31) .cse32 0))) |c_#memory_$Pointer$.offset|) (= (select |v_#valid_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 0) (= |v_ULTIMATE.start_dll_insert_#t~mem12#1.base_34| |v_ULTIMATE.start_dll_insert_#t~mem12#1.base_17|) (= (select |v_#valid_38| 0) 0) (= (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store (store (store (select |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_117| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 0))) |v_#memory_$Pointer$.base_117|) (= (store |v_#memory_$Pointer$.offset_112| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (select |v_#memory_$Pointer$.offset_112| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 0 (select .cse40 0))) |v_#memory_$Pointer$.offset_115|) (= |v_#memory_$Pointer$.base_116| (let ((.cse41 (store |v_#memory_$Pointer$.base_65| .cse42 (store (store .cse43 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 8 0)))) (store .cse41 |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (select .cse41 |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 8 .cse42)))) (= (select |v_#valid_38| 2) 1) (= (select |v_#valid_38| 1) 1) (= |v_ULTIMATE.start_dll_insert_#t~mem11#1.base_12| |v_ULTIMATE.start_dll_insert_#t~mem11#1.base_29|) (<= (+ .cse42 1) |c_#StackHeapBarrier|) (<= (+ |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| 1) |c_#StackHeapBarrier|) (= (select .cse44 .cse42) 0) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_36|)) (= (store (store (store (store |v_#length_32| |c_ULTIMATE.start_main_~#s~0#1.base| 4) |v_ULTIMATE.start_dll_create_~head~0#1.base_36| 12) .cse42 12) |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| 12) |c_#length|) (= (store |v_#memory_int_78| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (select |v_#memory_int_78| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 8 (select (select |v_#memory_int_202| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 8))) |v_#memory_int_202|) (= |v_#memory_int_78| (store |v_#memory_int_79| .cse42 (store .cse45 8 (select (select |v_#memory_int_78| .cse42) 8)))) (= |v_#memory_int_96| (store |v_#memory_int_98| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store .cse46 4 (select (select |v_#memory_int_96| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 4)))) (= (store |v_#memory_int_39| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store .cse47 8 (select .cse48 8))) |v_#memory_int_38|) (= |v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_34| |v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_17|) (= (select |v_#length_32| 2) 21) (= |v_#memory_int_79| (store |v_#memory_int_200| .cse42 (store (store (select |v_#memory_int_200| .cse42) 0 1) 4 (select .cse45 4)))) (= (select (select .cse49 |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_#memory_int_97| (let ((.cse50 (store |v_#memory_int_38| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store .cse48 0 1)))) (store .cse50 .cse37 (store (select .cse50 .cse37) .cse39 (select (select |v_#memory_int_97| .cse37) .cse39))))) (= |v_#memory_int_39| (store |v_#memory_int_202| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store (select |v_#memory_int_202| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 4 (select .cse47 4)))) (= |c_#valid| (store .cse51 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| 1)) (= |c_#memory_$Pointer$.base| (let ((.cse52 (let ((.cse53 (store |v_#memory_$Pointer$.base_117| .cse37 (store .cse54 .cse39 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|)))) (store .cse53 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store (store (select .cse53 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 8 .cse37) 4 .cse31))))) (store .cse52 .cse31 (store (select .cse52 .cse31) .cse32 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|)))) (= (store |v_#memory_int_198| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (store (select |v_#memory_int_198| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 0 1) 4 (select .cse55 4))) |v_#memory_int_201|) (= (select .cse56 0) 48) (= (select .cse51 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 0) (not (= .cse42 0)) (= |v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_33| |v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_16|) (= |v_#memory_$Pointer$.offset_117| (store .cse49 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store (store (store (select .cse49 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 0)))) (= (store |v_#memory_int_201| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store .cse55 8 (select (select |v_#memory_int_200| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 8))) |v_#memory_int_200|) (= (select .cse56 1) 0) (= |v_ULTIMATE.start_dll_insert_#t~mem13#1.base_33| |v_ULTIMATE.start_dll_insert_#t~mem13#1.base_16|) (= (store |v_#memory_int_97| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| (store (select |v_#memory_int_97| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34|) 8 (select .cse46 8))) |v_#memory_int_98|) (= (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_dll_create_~head~0#1.base_36|) 0 (select .cse57 0))) |v_#memory_$Pointer$.base_115|) (= |v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_12| |v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_29|) (= |v_#memory_$Pointer$.offset_65| (let ((.cse58 (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (store .cse40 4 0) 8 0)))) (store .cse58 .cse42 (store (select .cse58 .cse42) 0 (select .cse59 0))))) (= (let ((.cse60 (store |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_dll_create_~head~0#1.base_36| (store (store .cse57 4 0) 8 0)))) (store .cse60 .cse42 (store (select .cse60 .cse42) 0 (select .cse43 0)))) |v_#memory_$Pointer$.base_65|) (not (= |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_34| 0)) (= (select |v_#valid_38| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from false [2024-11-09 01:37:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:37:09,777 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-11-09 01:37:09,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:37:09,778 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 01:37:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:37:09,778 INFO L225 Difference]: With dead ends: 33 [2024-11-09 01:37:09,779 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 01:37:09,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 532.2s TimeCoverageRelationStatistics Valid=41, Invalid=217, Unknown=18, NotChecked=30, Total=306 [2024-11-09 01:37:09,780 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 44.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:37:09,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 35 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 8 Unknown, 11 Unchecked, 44.8s Time] [2024-11-09 01:37:09,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 01:37:09,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 01:37:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:37:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-09 01:37:09,796 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2024-11-09 01:37:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:37:09,796 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-09 01:37:09,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:37:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-09 01:37:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 01:37:09,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:37:09,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:37:09,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 01:37:09,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:37:09,999 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:37:09,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:09,999 INFO L85 PathProgramCache]: Analyzing trace with hash -29379180, now seen corresponding path program 1 times [2024-11-09 01:37:09,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:37:09,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757933146] [2024-11-09 01:37:09,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:09,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:37:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:37:10,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:37:10,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757933146] [2024-11-09 01:37:10,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757933146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:37:10,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009890524] [2024-11-09 01:37:10,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:10,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:37:10,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:37:10,143 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:37:10,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e71705e0-9305-4891-81fb-ec251f435e95/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:37:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:10,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:37:10,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:37:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:37:10,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:37:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:37:10,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009890524] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:37:10,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1189726922] [2024-11-09 01:37:10,368 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 01:37:10,368 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:37:10,368 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:37:10,368 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:37:10,369 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:37:20,998 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:37:38,830 WARN L286 SmtUtils]: Spent 13.02s on a formula simplification. DAG size of input: 220 DAG size of output: 220 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:38:17,348 WARN L286 SmtUtils]: Spent 22.87s on a formula simplification. DAG size of input: 235 DAG size of output: 232 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)