./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.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_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/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_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/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_57fc51f5-3c85-40a5-915a-3b313aba9966/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 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:34:50,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:34:50,665 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 05:34:50,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:34:50,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:34:50,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:34:50,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:34:50,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:34:50,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:34:50,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:34:50,730 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:34:50,731 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:34:50,731 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:34:50,731 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:34:50,732 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:34:50,732 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:34:50,732 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:34:50,733 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:34:50,733 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:34:50,738 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:34:50,738 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:34:50,740 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:34:50,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:34:50,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:34:50,742 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:34:50,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:34:50,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:34:50,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:34:50,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:34:50,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:34:50,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:34:50,744 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:34:50,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:34:50,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:34:50,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:34:50,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:34:50,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:34:50,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:34:50,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:34:50,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:34:50,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:34:50,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:34:50,769 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:34:50,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:34:50,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:34:50,771 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:34:50,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:34:50,771 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_57fc51f5-3c85-40a5-915a-3b313aba9966/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_57fc51f5-3c85-40a5-915a-3b313aba9966/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 -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2024-11-09 05:34:51,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:34:51,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:34:51,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:34:51,185 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:34:51,186 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:34:51,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i Unable to find full path for "g++" [2024-11-09 05:34:53,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:34:53,788 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:34:53,789 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-09 05:34:53,806 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/data/2de9e0d8b/6dab3699203f49f1b1e3203be23aa983/FLAG2d4ec983f [2024-11-09 05:34:53,825 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/data/2de9e0d8b/6dab3699203f49f1b1e3203be23aa983 [2024-11-09 05:34:53,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:34:53,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:34:53,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:34:53,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:34:53,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:34:53,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:34:53" (1/1) ... [2024-11-09 05:34:53,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516fde56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:53, skipping insertion in model container [2024-11-09 05:34:53,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:34:53" (1/1) ... [2024-11-09 05:34:53,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:34:54,255 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_57fc51f5-3c85-40a5-915a-3b313aba9966/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2024-11-09 05:34:54,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:34:54,276 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:34:54,357 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_57fc51f5-3c85-40a5-915a-3b313aba9966/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2024-11-09 05:34:54,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:34:54,391 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:34:54,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:54 WrapperNode [2024-11-09 05:34:54,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:34:54,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:34:54,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:34:54,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:34:54,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:54" (1/1) ... [2024-11-09 05:34:54,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:54" (1/1) ... [2024-11-09 05:34:54,449 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 163 [2024-11-09 05:34:54,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:34:54,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:34:54,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:34:54,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:34:54,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:54" (1/1) ... [2024-11-09 05:34:54,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:54" (1/1) ... [2024-11-09 05:34:54,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:54" (1/1) ... [2024-11-09 05:34:54,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:54" (1/1) ... [2024-11-09 05:34:54,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:54" (1/1) ... [2024-11-09 05:34:54,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:54" (1/1) ... [2024-11-09 05:34:54,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:54" (1/1) ... [2024-11-09 05:34:54,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:54" (1/1) ... [2024-11-09 05:34:54,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:34:54,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:34:54,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:34:54,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:34:54,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:54" (1/1) ... [2024-11-09 05:34:54,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:34:54,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:34:54,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:34:54,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:34:54,601 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 05:34:54,601 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 05:34:54,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:34:54,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:34:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:34:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:34:54,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:34:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:34:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:34:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:34:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 05:34:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:34:54,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:34:54,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:34:54,762 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:34:54,765 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:34:54,789 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 05:34:55,144 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2024-11-09 05:34:55,145 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:34:55,334 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:34:55,335 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 05:34:55,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:34:55 BoogieIcfgContainer [2024-11-09 05:34:55,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:34:55,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:34:55,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:34:55,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:34:55,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:34:53" (1/3) ... [2024-11-09 05:34:55,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f70ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:34:55, skipping insertion in model container [2024-11-09 05:34:55,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:54" (2/3) ... [2024-11-09 05:34:55,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f70ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:34:55, skipping insertion in model container [2024-11-09 05:34:55,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:34:55" (3/3) ... [2024-11-09 05:34:55,354 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2024-11-09 05:34:55,379 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:34:55,379 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:34:55,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:34:55,465 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;@5f67a7e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:34:55,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:34:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 29 states have internal predecessors, (44), 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 05:34:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:34:55,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:55,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:34:55,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:34:55,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:55,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2141655887, now seen corresponding path program 1 times [2024-11-09 05:34:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:34:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647899269] [2024-11-09 05:34:55,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:55,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:34:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:56,034 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 05:34:56,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:34:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647899269] [2024-11-09 05:34:56,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647899269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:34:56,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:34:56,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:34:56,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178158501] [2024-11-09 05:34:56,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:34:56,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:34:56,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:34:56,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:34:56,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:34:56,075 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 29 states have internal predecessors, (44), 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.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 05:34:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:34:56,285 INFO L93 Difference]: Finished difference Result 61 states and 91 transitions. [2024-11-09 05:34:56,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:34:56,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2024-11-09 05:34:56,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:34:56,296 INFO L225 Difference]: With dead ends: 61 [2024-11-09 05:34:56,296 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 05:34:56,300 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 05:34:56,303 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 72 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:34:56,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 72 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:34:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 05:34:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-09 05:34:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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 05:34:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2024-11-09 05:34:56,346 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2024-11-09 05:34:56,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:34:56,346 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2024-11-09 05:34:56,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 05:34:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2024-11-09 05:34:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:34:56,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:56,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:34:56,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:34:56,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:34:56,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:56,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1109835617, now seen corresponding path program 1 times [2024-11-09 05:34:56,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:34:56,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633591870] [2024-11-09 05:34:56,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:56,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:34:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:56,666 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 05:34:56,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:34:56,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633591870] [2024-11-09 05:34:56,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633591870] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:34:56,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156553841] [2024-11-09 05:34:56,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:56,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:34:56,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:34:56,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:34:56,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:34:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:56,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:34:56,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:34:56,977 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 05:34:56,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:34:57,005 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 05:34:57,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156553841] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:34:57,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [18614045] [2024-11-09 05:34:57,035 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 05:34:57,036 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:34:57,040 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:34:57,046 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:34:57,047 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:34:58,598 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:35:09,480 WARN L286 SmtUtils]: Spent 10.51s 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 05:35:31,898 WARN L286 SmtUtils]: Spent 7.04s on a formula simplification. DAG size of input: 225 DAG size of output: 224 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:35:31,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [18614045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:31,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:35:31,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 9 [2024-11-09 05:35:31,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971943323] [2024-11-09 05:35:31,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:31,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:35:31,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:31,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:35:31,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=66, Unknown=4, NotChecked=0, Total=90 [2024-11-09 05:35:31,905 INFO L87 Difference]: Start difference. First operand 24 states and 34 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 05:35:40,900 WARN L286 SmtUtils]: Spent 5.34s 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 05:35:42,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:35:44,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:35:47,078 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 05:35:49,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:35:52,086 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 05:35:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:57,720 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2024-11-09 05:35:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:35:57,721 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 05:35:57,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:57,722 INFO L225 Difference]: With dead ends: 43 [2024-11-09 05:35:57,722 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 05:35:57,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=25, Invalid=78, Unknown=7, NotChecked=0, Total=110 [2024-11-09 05:35:57,724 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:57,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 67 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 16.8s Time] [2024-11-09 05:35:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 05:35:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-09 05:35:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 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 05:35:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-11-09 05:35:57,734 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 15 [2024-11-09 05:35:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:57,735 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-11-09 05:35:57,735 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 05:35:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-11-09 05:35:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 05:35:57,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:57,736 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 05:35:57,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:35:57,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-09 05:35:57,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:35:57,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:57,942 INFO L85 PathProgramCache]: Analyzing trace with hash -62111100, now seen corresponding path program 1 times [2024-11-09 05:35:57,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:57,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719354630] [2024-11-09 05:35:57,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:57,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:58,165 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 05:35:58,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:58,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719354630] [2024-11-09 05:35:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719354630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:35:58,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539004954] [2024-11-09 05:35:58,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:58,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:35:58,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:35:58,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:35:58,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:35:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:58,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:35:58,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:58,362 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 05:35:58,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:35:58,398 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 05:35:58,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539004954] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:35:58,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1263672727] [2024-11-09 05:35:58,401 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 05:35:58,402 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:35:58,403 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:35:58,404 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:35:58,404 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:36:05,098 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:36:18,446 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 05:36:56,301 WARN L286 SmtUtils]: Spent 23.99s on a formula simplification. DAG size of input: 240 DAG size of output: 237 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:37:07,675 WARN L286 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 226 DAG size of output: 224 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:37:18,278 WARN L286 SmtUtils]: Spent 9.55s on a formula simplification. DAG size of input: 229 DAG size of output: 227 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:38:37,659 WARN L286 SmtUtils]: Spent 1.09m on a formula simplification. DAG size of input: 370 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:40:33,638 WARN L286 SmtUtils]: Spent 1.64m on a formula simplification. DAG size of input: 375 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:42:54,793 WARN L286 SmtUtils]: Spent 2.02m on a formula simplification. DAG size of input: 384 DAG size of output: 298 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:42:54,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1263672727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:42:54,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:42:54,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [3, 3, 3] total 14 [2024-11-09 05:42:54,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885742895] [2024-11-09 05:42:54,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:42:54,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:42:54,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:42:54,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:42:54,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=165, Unknown=15, NotChecked=0, Total=210 [2024-11-09 05:42:54,799 INFO L87 Difference]: Start difference. First operand 25 states and 34 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 05:43:05,776 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 05:43:08,233 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 05:43:10,962 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 05:43:16,241 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 05:43:20,645 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 05:43:24,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:43:26,374 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 05:43:27,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:43:29,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:43:30,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:43:32,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:43:35,169 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 05:43:36,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:43:42,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:43:45,075 WARN L851 $PredicateComparison]: unable to prove that (and (= |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_~uneq~0#1| 5) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~mid_index~0#1| 1) (= |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_#memory_$Pointer$.offset_104| (Array Int (Array Int Int))) (|v_#memory_int_98| (Array Int (Array Int Int))) (|v_#memory_int_99| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.base_24| Int) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.base_17| Int) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_29| Int) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_28| Int) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_24| Int) (|v_#length_25| (Array Int Int)) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_104| (Array Int (Array Int Int))) (|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_166| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.base_16| Int) (|v_#memory_$Pointer$.base_103| (Array Int (Array Int Int))) (|v_#memory_int_167| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_102| (Array Int (Array Int Int))) (|v_#memory_int_168| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_102| (Array Int (Array Int Int))) (|v_#memory_int_164| (Array Int (Array Int Int))) (|v_#memory_int_40| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_31| Int) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int))) (|v_#valid_31| (Array Int Int)) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.base_12| Int) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.base_29| Int) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_17| Int) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_16| Int) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_12| Int) (|v_#memory_$Pointer$.offset_99| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.base_28| Int) (|v_#memory_int_80| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| Int) (|v_#memory_int_81| (Array Int (Array Int Int)))) (let ((.cse27 (select (select |v_#memory_$Pointer$.offset_104| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |v_#memory_$Pointer$.base_104| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |v_#memory_$Pointer$.base_103| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse29 (select |v_#memory_$Pointer$.offset_104| .cse1)) (.cse2 (+ .cse27 4))) (let ((.cse28 (select .cse29 .cse2)) (.cse14 (select |v_#memory_$Pointer$.base_104| .cse1)) (.cse22 (store (store |v_#valid_31| |c_ULTIMATE.start_main_~#s~0#1.base| 1) |v_ULTIMATE.start_dll_create_~head~0#1.base_31| 1)) (.cse17 (select |v_#memory_$Pointer$.offset_67| .cse5))) (let ((.cse3 (select |v_#memory_int_40| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|)) (.cse7 (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) (.cse9 (let ((.cse30 (store |v_#memory_$Pointer$.offset_67| .cse5 (store (store .cse17 4 0) 8 0)))) (store .cse30 |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select .cse30 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 0)))) (.cse20 (select |v_#memory_int_100| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|)) (.cse21 (select |v_#memory_int_167| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) (.cse8 (select |v_#memory_int_41| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|)) (.cse19 (select |v_#memory_int_80| .cse5)) (.cse18 (select |v_#memory_$Pointer$.offset_102| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) (.cse6 (select |v_#memory_$Pointer$.base_67| .cse5)) (.cse15 (select |v_#memory_int_164| 1)) (.cse24 (store .cse22 .cse5 1)) (.cse11 (select .cse14 .cse2)) (.cse12 (+ 8 .cse28))) (and (= |v_#memory_int_99| (let ((.cse0 (store |v_#memory_int_40| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store .cse3 0 5)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 (select (select |v_#memory_int_99| .cse1) .cse2))))) (= (let ((.cse4 (store |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (store .cse7 4 0) 8 0)))) (store .cse4 .cse5 (store (select .cse4 .cse5) 0 (select .cse6 0)))) |v_#memory_$Pointer$.base_67|) (= 23 (select |v_#length_25| 2)) (= |v_#memory_int_40| (store |v_#memory_int_41| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store .cse8 8 (select .cse3 8)))) (= (store .cse9 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store (store (store (select .cse9 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_104| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 0))) |v_#memory_$Pointer$.offset_104|) (= |v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_16| |v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_28|) (= (let ((.cse10 (let ((.cse13 (store |v_#memory_$Pointer$.base_104| .cse1 (store .cse14 .cse2 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|)))) (store .cse13 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store (store (select .cse13 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 8 .cse1) 4 .cse11))))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|))) |c_#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 0 (select .cse7 0))) |v_#memory_$Pointer$.base_102|) (<= (+ |v_ULTIMATE.start_dll_create_~head~0#1.base_31| 1) |c_#StackHeapBarrier|) (= (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select .cse15 0) 48) (= (let ((.cse16 (store |v_#memory_$Pointer$.offset_102| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (store .cse18 4 0) 8 0)))) (store .cse16 .cse5 (store (select .cse16 .cse5) 0 (select .cse17 0)))) |v_#memory_$Pointer$.offset_67|) (= |v_ULTIMATE.start_dll_insert_#t~mem11#1.base_12| |v_ULTIMATE.start_dll_insert_#t~mem11#1.base_24|) (= (select |v_#valid_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 0) (= (store |v_#memory_int_166| .cse5 (store (store (select |v_#memory_int_166| .cse5) 0 1) 4 (select .cse19 4))) |v_#memory_int_80|) (= |v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_12| |v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_24|) (= (store |v_#memory_int_100| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store .cse20 4 (select (select |v_#memory_int_98| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 4))) |v_#memory_int_98|) (= (store |v_#memory_int_99| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store (select |v_#memory_int_99| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 8 (select .cse20 8))) |v_#memory_int_100|) (= (store |v_#memory_int_167| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store .cse21 8 (select (select |v_#memory_int_166| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8))) |v_#memory_int_166|) (= (select |v_#valid_31| 0) 0) (= (store |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store (store (store (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_104| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 0))) |v_#memory_$Pointer$.base_104|) (= (select |v_#valid_31| 2) 1) (= (store |v_#memory_int_164| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (store (select |v_#memory_int_164| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 0 1) 4 (select .cse21 4))) |v_#memory_int_167|) (= (select .cse22 .cse5) 0) (= (select |v_#length_25| 1) 2) (= (store |v_#memory_int_168| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store (select |v_#memory_int_168| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 4 (select .cse8 4))) |v_#memory_int_41|) (= (select |v_#valid_31| 1) 1) (= |v_#memory_int_81| (store |v_#memory_int_80| .cse5 (store .cse19 8 (select (select |v_#memory_int_81| .cse5) 8)))) (= (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 0 (select .cse18 0))) |v_#memory_$Pointer$.offset_102|) (= |v_ULTIMATE.start_dll_insert_#t~mem12#1.base_17| |v_ULTIMATE.start_dll_insert_#t~mem12#1.base_29|) (<= (+ |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| 1) |c_#StackHeapBarrier|) (= (let ((.cse23 (store |v_#memory_$Pointer$.base_67| .cse5 (store (store .cse6 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 0)))) (store .cse23 |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select .cse23 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 .cse5))) |v_#memory_$Pointer$.base_103|) (= (select |v_#valid_31| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) (= |c_#valid| (store .cse24 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| 1)) (= (store (store (store (store |v_#length_25| |c_ULTIMATE.start_main_~#s~0#1.base| 4) |v_ULTIMATE.start_dll_create_~head~0#1.base_31| 12) .cse5 12) |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| 12) |c_#length|) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) (= (select .cse15 1) 0) (= (let ((.cse25 (let ((.cse26 (store |v_#memory_$Pointer$.offset_104| .cse1 (store .cse29 .cse2 0)))) (store .cse26 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store (store (select .cse26 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 8 .cse27) 4 .cse28))))) (store .cse25 .cse11 (store (select .cse25 .cse11) .cse12 0))) |c_#memory_$Pointer$.offset|) (= |v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_17| |v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_29|) (= (select .cse24 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 0) (= (store |v_#memory_int_98| .cse11 (store (select |v_#memory_int_98| .cse11) .cse12 (select (select |c_#memory_int| .cse11) .cse12))) |c_#memory_int|) (= |v_ULTIMATE.start_dll_insert_#t~mem13#1.base_16| |v_ULTIMATE.start_dll_insert_#t~mem13#1.base_28|) (<= (+ 1 .cse5) |c_#StackHeapBarrier|) (not (= 0 .cse5)) (not (= |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| 0)) (= (store |v_#memory_int_81| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select |v_#memory_int_81| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 (select (select |v_#memory_int_168| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8))) |v_#memory_int_168|))))))) (exists ((|v_#memory_$Pointer$.offset_104| (Array Int (Array Int Int))) (|v_#memory_int_98| (Array Int (Array Int Int))) (|v_#memory_int_99| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.base_24| Int) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.base_17| Int) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_29| Int) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_28| Int) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_24| Int) (|v_#length_25| (Array Int Int)) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_104| (Array Int (Array Int Int))) (|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_166| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.base_16| Int) (|v_#memory_$Pointer$.base_103| (Array Int (Array Int Int))) (|v_#memory_int_167| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_102| (Array Int (Array Int Int))) (|v_#memory_int_168| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_102| (Array Int (Array Int Int))) (|v_#memory_int_164| (Array Int (Array Int Int))) (|v_#memory_int_40| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_31| Int) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int))) (|v_#valid_31| (Array Int Int)) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.base_12| Int) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.base_29| Int) (|v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_17| Int) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_16| Int) (|v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_12| Int) (|v_#memory_$Pointer$.offset_99| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_#t~mem13#1.base_28| Int) (|v_#memory_int_80| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| Int) (|v_#memory_int_81| (Array Int (Array Int Int)))) (let ((.cse58 (select (select |v_#memory_$Pointer$.offset_104| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse32 (select (select |v_#memory_$Pointer$.base_104| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse36 (select (select |v_#memory_$Pointer$.base_103| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse60 (select |v_#memory_$Pointer$.offset_104| .cse32)) (.cse33 (+ .cse58 4))) (let ((.cse59 (select .cse60 .cse33)) (.cse45 (select |v_#memory_$Pointer$.base_104| .cse32)) (.cse53 (store (store |v_#valid_31| |c_ULTIMATE.start_main_~#s~0#1.base| 1) |v_ULTIMATE.start_dll_create_~head~0#1.base_31| 1)) (.cse48 (select |v_#memory_$Pointer$.offset_67| .cse36))) (let ((.cse34 (select |v_#memory_int_40| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|)) (.cse38 (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) (.cse40 (let ((.cse61 (store |v_#memory_$Pointer$.offset_67| .cse36 (store (store .cse48 4 0) 8 0)))) (store .cse61 |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select .cse61 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 0)))) (.cse51 (select |v_#memory_int_100| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|)) (.cse52 (select |v_#memory_int_167| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) (.cse39 (select |v_#memory_int_41| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|)) (.cse50 (select |v_#memory_int_80| .cse36)) (.cse49 (select |v_#memory_$Pointer$.offset_102| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) (.cse37 (select |v_#memory_$Pointer$.base_67| .cse36)) (.cse46 (select |v_#memory_int_164| 1)) (.cse55 (store .cse53 .cse36 1)) (.cse42 (select .cse45 .cse33)) (.cse43 (+ 8 .cse59))) (and (= |v_#memory_int_99| (let ((.cse31 (store |v_#memory_int_40| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store .cse34 0 5)))) (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 (select (select |v_#memory_int_99| .cse32) .cse33))))) (= (let ((.cse35 (store |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (store .cse38 4 0) 8 0)))) (store .cse35 .cse36 (store (select .cse35 .cse36) 0 (select .cse37 0)))) |v_#memory_$Pointer$.base_67|) (= 23 (select |v_#length_25| 2)) (= |v_#memory_int_40| (store |v_#memory_int_41| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store .cse39 8 (select .cse34 8)))) (= (store .cse40 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store (store (store (select .cse40 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_104| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 0))) |v_#memory_$Pointer$.offset_104|) (= |v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_16| |v_ULTIMATE.start_dll_insert_#t~mem13#1.offset_28|) (= (let ((.cse41 (let ((.cse44 (store |v_#memory_$Pointer$.base_104| .cse32 (store .cse45 .cse33 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|)))) (store .cse44 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store (store (select .cse44 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 8 .cse32) 4 .cse42))))) (store .cse41 .cse42 (store (select .cse41 .cse42) .cse43 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|))) |c_#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select |v_#memory_$Pointer$.base_99| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 0 (select .cse38 0))) |v_#memory_$Pointer$.base_102|) (<= (+ |v_ULTIMATE.start_dll_create_~head~0#1.base_31| 1) |c_#StackHeapBarrier|) (= (select (select .cse40 |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select .cse46 0) 48) (= (let ((.cse47 (store |v_#memory_$Pointer$.offset_102| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (store .cse49 4 0) 8 0)))) (store .cse47 .cse36 (store (select .cse47 .cse36) 0 (select .cse48 0)))) |v_#memory_$Pointer$.offset_67|) (= |v_ULTIMATE.start_dll_insert_#t~mem11#1.base_12| |v_ULTIMATE.start_dll_insert_#t~mem11#1.base_24|) (= (select |v_#valid_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 0) (= (store |v_#memory_int_166| .cse36 (store (store (select |v_#memory_int_166| .cse36) 0 1) 4 (select .cse50 4))) |v_#memory_int_80|) (= |v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_12| |v_ULTIMATE.start_dll_insert_#t~mem11#1.offset_24|) (= (store |v_#memory_int_100| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store .cse51 4 (select (select |v_#memory_int_98| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 4))) |v_#memory_int_98|) (= (store |v_#memory_int_99| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store (select |v_#memory_int_99| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 8 (select .cse51 8))) |v_#memory_int_100|) (= (store |v_#memory_int_167| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store .cse52 8 (select (select |v_#memory_int_166| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8))) |v_#memory_int_166|) (= (select |v_#valid_31| 0) 0) (= (store |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store (store (store (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_104| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 0))) |v_#memory_$Pointer$.base_104|) (= (select |v_#valid_31| 2) 1) (= (store |v_#memory_int_164| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (store (select |v_#memory_int_164| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 0 1) 4 (select .cse52 4))) |v_#memory_int_167|) (= (select .cse53 .cse36) 0) (= (select |v_#length_25| 1) 2) (= (store |v_#memory_int_168| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store (select |v_#memory_int_168| |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 4 (select .cse39 4))) |v_#memory_int_41|) (= (select |v_#valid_31| 1) 1) (= |v_#memory_int_81| (store |v_#memory_int_80| .cse36 (store .cse50 8 (select (select |v_#memory_int_81| .cse36) 8)))) (= (store |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_99| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 0 (select .cse49 0))) |v_#memory_$Pointer$.offset_102|) (= |v_ULTIMATE.start_dll_insert_#t~mem12#1.base_17| |v_ULTIMATE.start_dll_insert_#t~mem12#1.base_29|) (<= (+ |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| 1) |c_#StackHeapBarrier|) (= (let ((.cse54 (store |v_#memory_$Pointer$.base_67| .cse36 (store (store .cse37 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 0)))) (store .cse54 |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select .cse54 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 .cse36))) |v_#memory_$Pointer$.base_103|) (= (select |v_#valid_31| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) (= |c_#valid| (store .cse55 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| 1)) (= (store (store (store (store |v_#length_25| |c_ULTIMATE.start_main_~#s~0#1.base| 4) |v_ULTIMATE.start_dll_create_~head~0#1.base_31| 12) .cse36 12) |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| 12) |c_#length|) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) (= (select .cse46 1) 0) (= (let ((.cse56 (let ((.cse57 (store |v_#memory_$Pointer$.offset_104| .cse32 (store .cse60 .cse33 0)))) (store .cse57 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| (store (store (select .cse57 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 8 .cse58) 4 .cse59))))) (store .cse56 .cse42 (store (select .cse56 .cse42) .cse43 0))) |c_#memory_$Pointer$.offset|) (= |v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_17| |v_ULTIMATE.start_dll_insert_#t~mem12#1.offset_29|) (= (select .cse55 |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31|) 0) (= (store |v_#memory_int_98| .cse42 (store (select |v_#memory_int_98| .cse42) .cse43 (select (select |c_#memory_int| .cse42) .cse43))) |c_#memory_int|) (= |v_ULTIMATE.start_dll_insert_#t~mem13#1.base_16| |v_ULTIMATE.start_dll_insert_#t~mem13#1.base_28|) (<= (+ 1 .cse36) |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_dll_insert_~new_node~0#1.base_31| 0)) (= (store |v_#memory_int_81| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select |v_#memory_int_81| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 (select (select |v_#memory_int_168| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8))) |v_#memory_int_168|))))))) (<= (+ |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 05:43:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:43:52,952 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2024-11-09 05:43:52,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:43:52,953 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 05:43:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:43:52,953 INFO L225 Difference]: With dead ends: 40 [2024-11-09 05:43:52,953 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 05:43:52,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 419.8s TimeCoverageRelationStatistics Valid=37, Invalid=189, Unknown=18, NotChecked=28, Total=272 [2024-11-09 05:43:52,955 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 3 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 48.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:43:52,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 65 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 271 Invalid, 8 Unknown, 23 Unchecked, 48.1s Time] [2024-11-09 05:43:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 05:43:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-09 05:43:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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 05:43:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-11-09 05:43:52,965 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2024-11-09 05:43:52,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:43:52,965 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-09 05:43:52,965 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 05:43:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-11-09 05:43:52,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 05:43:52,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:43:52,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:43:52,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 05:43:53,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-09 05:43:53,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:43:53,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:43:53,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1925498986, now seen corresponding path program 1 times [2024-11-09 05:43:53,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:43:53,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087117224] [2024-11-09 05:43:53,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:43:53,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:43:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:43:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:43:53,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:43:53,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087117224] [2024-11-09 05:43:53,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087117224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:43:53,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:43:53,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:43:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825217273] [2024-11-09 05:43:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:43:53,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:43:53,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:43:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:43:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:43:53,295 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 05:43:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:43:53,489 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2024-11-09 05:43:53,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:43:53,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-11-09 05:43:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:43:53,490 INFO L225 Difference]: With dead ends: 35 [2024-11-09 05:43:53,490 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 05:43:53,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:43:53,491 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:43:53,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:43:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 05:43:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 05:43:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 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 05:43:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-09 05:43:53,503 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 18 [2024-11-09 05:43:53,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:43:53,504 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-09 05:43:53,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 05:43:53,504 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-09 05:43:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:43:53,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:43:53,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:43:53,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:43:53,505 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:43:53,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:43:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash 779390750, now seen corresponding path program 1 times [2024-11-09 05:43:53,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:43:53,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303071645] [2024-11-09 05:43:53,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:43:53,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:43:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:43:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:43:53,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:43:53,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303071645] [2024-11-09 05:43:53,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303071645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:43:53,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231809621] [2024-11-09 05:43:53,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:43:53,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:43:53,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:43:53,662 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:43:53,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:43:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:43:53,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:43:53,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:43:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:43:53,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:43:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:43:53,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231809621] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:43:53,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [882854512] [2024-11-09 05:43:53,881 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 05:43:53,881 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:43:53,881 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:43:53,881 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:43:53,882 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:43:59,554 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:44:12,316 WARN L286 SmtUtils]: Spent 12.56s 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 05:44:43,956 WARN L286 SmtUtils]: Spent 16.85s on a formula simplification. DAG size of input: 240 DAG size of output: 237 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:44:51,994 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 226 DAG size of output: 224 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:45:00,582 WARN L286 SmtUtils]: Spent 7.52s on a formula simplification. DAG size of input: 229 DAG size of output: 227 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:46:30,348 WARN L286 SmtUtils]: Spent 1.23m on a formula simplification. DAG size of input: 377 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:48:49,042 WARN L286 SmtUtils]: Spent 2.00m on a formula simplification. DAG size of input: 384 DAG size of output: 298 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:48:49,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [882854512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:49,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:48:49,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [3, 3, 3] total 14 [2024-11-09 05:48:49,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672244175] [2024-11-09 05:48:49,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:49,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:48:49,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:48:49,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:48:49,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=169, Unknown=9, NotChecked=0, Total=210 [2024-11-09 05:48:49,045 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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 05:48:58,773 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 05:49:00,800 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 05:49:03,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:49:05,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:49:09,606 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 05:49:13,509 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 05:49:16,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:49:17,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:49:19,884 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 05:49:21,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:49:23,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:49:24,625 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 05:49:26,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:49:27,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:49:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:49:41,053 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2024-11-09 05:49:41,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:49:41,053 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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 20 [2024-11-09 05:49:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:49:41,054 INFO L225 Difference]: With dead ends: 29 [2024-11-09 05:49:41,054 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 05:49:41,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 297.4s TimeCoverageRelationStatistics Valid=37, Invalid=192, Unknown=11, NotChecked=0, Total=240 [2024-11-09 05:49:41,055 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:49:41,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 8 Unknown, 0 Unchecked, 44.1s Time] [2024-11-09 05:49:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 05:49:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-11-09 05:49:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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 05:49:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-09 05:49:41,072 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 20 [2024-11-09 05:49:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:49:41,072 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-09 05:49:41,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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 05:49:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-09 05:49:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:49:41,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:49:41,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:49:41,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 05:49:41,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:49:41,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:49:41,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:49:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash 779757170, now seen corresponding path program 1 times [2024-11-09 05:49:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:49:41,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15409359] [2024-11-09 05:49:41,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:41,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:49:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:41,409 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 05:49:41,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:49:41,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15409359] [2024-11-09 05:49:41,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15409359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:49:41,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477601674] [2024-11-09 05:49:41,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:49:41,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:49:41,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:49:41,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:49:41,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57fc51f5-3c85-40a5-915a-3b313aba9966/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:49:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:49:41,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:49:41,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:49:41,620 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 05:49:41,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:49:41,644 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 05:49:41,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477601674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:49:41,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1725586450] [2024-11-09 05:49:41,646 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 05:49:41,646 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:49:41,647 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:49:41,647 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:49:41,647 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:49:48,616 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:49:59,892 WARN L286 SmtUtils]: Spent 10.89s 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)