./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/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_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/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_d5a04c94-c70d-4db9-9d34-671e442f8182/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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:34:28,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:34:28,751 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 04:34:28,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:34:28,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:34:28,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:34:28,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:34:28,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:34:28,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:34:28,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:34:28,800 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:34:28,800 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:34:28,801 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:34:28,801 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:34:28,801 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:34:28,802 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:34:28,805 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:34:28,806 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:34:28,806 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:34:28,806 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:34:28,807 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:34:28,807 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:34:28,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:34:28,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:34:28,810 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:34:28,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:34:28,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:34:28,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:34:28,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:34:28,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:34:28,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:34:28,813 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:34:28,813 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:34:28,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:34:28,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:34:28,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:34:28,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:34:28,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:34:28,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:34:28,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:34:28,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:34:28,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:34:28,817 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:34:28,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:34:28,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:34:28,818 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:34:28,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:34:28,818 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_d5a04c94-c70d-4db9-9d34-671e442f8182/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_d5a04c94-c70d-4db9-9d34-671e442f8182/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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2024-11-09 04:34:29,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:34:29,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:34:29,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:34:29,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:34:29,134 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:34:29,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i Unable to find full path for "g++" [2024-11-09 04:34:31,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:34:31,901 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:34:31,902 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-11-09 04:34:31,918 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/data/e6387277f/cd4177da4de843a8995f77b80c8e693e/FLAG743b8cde2 [2024-11-09 04:34:31,937 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/data/e6387277f/cd4177da4de843a8995f77b80c8e693e [2024-11-09 04:34:31,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:34:31,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:34:31,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:34:31,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:34:31,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:34:31,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:34:31" (1/1) ... [2024-11-09 04:34:31,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9e7ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:31, skipping insertion in model container [2024-11-09 04:34:31,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:34:31" (1/1) ... [2024-11-09 04:34:32,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:34:32,447 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_d5a04c94-c70d-4db9-9d34-671e442f8182/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2024-11-09 04:34:32,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:34:32,471 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:34:32,571 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_d5a04c94-c70d-4db9-9d34-671e442f8182/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2024-11-09 04:34:32,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:34:32,612 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:34:32,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:32 WrapperNode [2024-11-09 04:34:32,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:34:32,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:34:32,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:34:32,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:34:32,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:32" (1/1) ... [2024-11-09 04:34:32,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:32" (1/1) ... [2024-11-09 04:34:32,673 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2024-11-09 04:34:32,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:34:32,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:34:32,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:34:32,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:34:32,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:32" (1/1) ... [2024-11-09 04:34:32,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:32" (1/1) ... [2024-11-09 04:34:32,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:32" (1/1) ... [2024-11-09 04:34:32,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:32" (1/1) ... [2024-11-09 04:34:32,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:32" (1/1) ... [2024-11-09 04:34:32,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:32" (1/1) ... [2024-11-09 04:34:32,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:32" (1/1) ... [2024-11-09 04:34:32,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:32" (1/1) ... [2024-11-09 04:34:32,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:34:32,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:34:32,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:34:32,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:34:32,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:32" (1/1) ... [2024-11-09 04:34:32,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:34:32,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:34:32,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:34:32,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:34:32,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:34:32,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:34:32,809 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 04:34:32,809 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 04:34:32,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:34:32,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:34:32,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:34:32,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:34:32,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:34:32,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:34:32,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 04:34:32,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:34:32,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:34:32,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:34:32,967 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:34:32,970 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:34:33,267 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-09 04:34:33,267 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:34:33,361 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:34:33,361 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:34:33,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:34:33 BoogieIcfgContainer [2024-11-09 04:34:33,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:34:33,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:34:33,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:34:33,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:34:33,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:34:31" (1/3) ... [2024-11-09 04:34:33,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55797990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:34:33, skipping insertion in model container [2024-11-09 04:34:33,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:34:32" (2/3) ... [2024-11-09 04:34:33,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55797990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:34:33, skipping insertion in model container [2024-11-09 04:34:33,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:34:33" (3/3) ... [2024-11-09 04:34:33,373 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2024-11-09 04:34:33,395 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:34:33,395 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:34:33,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:34:33,473 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;@6e698178, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:34:33,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:34:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:34:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 04:34:33,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:34:33,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:34:33,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:34:33,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:34:33,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1262473326, now seen corresponding path program 1 times [2024-11-09 04:34:33,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:34:33,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062088533] [2024-11-09 04:34:33,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:33,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:34:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:34,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 04:34:34,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:34:34,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062088533] [2024-11-09 04:34:34,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062088533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:34:34,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:34:34,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:34:34,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268538403] [2024-11-09 04:34:34,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:34:34,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:34:34,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:34:34,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:34:34,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:34:34,081 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 04:34:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:34:34,187 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2024-11-09 04:34:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:34:34,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 04:34:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:34:34,201 INFO L225 Difference]: With dead ends: 51 [2024-11-09 04:34:34,201 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 04:34:34,205 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 04:34:34,212 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:34:34,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 54 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:34:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 04:34:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-09 04:34:34,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:34:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-11-09 04:34:34,259 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2024-11-09 04:34:34,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:34:34,260 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-09 04:34:34,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 04:34:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-11-09 04:34:34,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 04:34:34,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:34:34,263 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 04:34:34,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:34:34,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:34:34,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:34:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1098577335, now seen corresponding path program 1 times [2024-11-09 04:34:34,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:34:34,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588053751] [2024-11-09 04:34:34,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:34,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:34:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:34:34,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:34:34,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588053751] [2024-11-09 04:34:34,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588053751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:34:34,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809124396] [2024-11-09 04:34:34,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:34,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:34:34,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:34:34,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:34:34,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:34:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:34,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 04:34:34,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:34:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:34:34,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:34:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:34:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809124396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:34:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1745681934] [2024-11-09 04:34:34,963 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 04:34:34,963 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:34:34,967 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:34:34,973 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:34:34,973 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:34:36,754 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 129 for LOIs [2024-11-09 04:34:37,023 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:34:41,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1745681934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:34:41,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:34:41,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4, 4, 4] total 15 [2024-11-09 04:34:41,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027028116] [2024-11-09 04:34:41,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:34:41,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:34:41,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:34:41,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:34:41,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=177, Unknown=1, NotChecked=0, Total=210 [2024-11-09 04:34:41,328 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:34:43,728 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 04:34:45,735 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 04:34:48,484 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 04:34:50,491 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 04:34:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:34:51,387 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-11-09 04:34:51,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 04:34:51,388 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-11-09 04:34:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:34:51,389 INFO L225 Difference]: With dead ends: 41 [2024-11-09 04:34:51,389 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 04:34:51,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=47, Invalid=258, Unknown=1, NotChecked=0, Total=306 [2024-11-09 04:34:51,392 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:34:51,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 77 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 14 Unknown, 0 Unchecked, 9.6s Time] [2024-11-09 04:34:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 04:34:51,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-09 04:34:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:34:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-11-09 04:34:51,403 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 20 [2024-11-09 04:34:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:34:51,403 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-11-09 04:34:51,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:34:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-11-09 04:34:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 04:34:51,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:34:51,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:34:51,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:34:51,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:34:51,605 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:34:51,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:34:51,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1008010308, now seen corresponding path program 1 times [2024-11-09 04:34:51,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:34:51,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293856850] [2024-11-09 04:34:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:51,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:34:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:51,724 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 04:34:51,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:34:51,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293856850] [2024-11-09 04:34:51,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293856850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:34:51,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378409218] [2024-11-09 04:34:51,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:51,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:34:51,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:34:51,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:34:51,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:34:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:51,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 04:34:51,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:34:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 04:34:51,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:34:51,923 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 04:34:51,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378409218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:34:51,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2092851213] [2024-11-09 04:34:51,926 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 04:34:51,927 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:34:51,927 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:34:51,927 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:34:51,928 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:34:53,065 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 129 for LOIs [2024-11-09 04:34:53,252 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:34:59,213 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '485#(and (exists ((|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_#memory_int_87| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~head#1.base_16| Int) (|v_#memory_$Pointer$.base_38| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_21| Int) (|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_38| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_21| Int) (|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_21| Int)) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_21| (store (select |v_#memory_$Pointer$.offset_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_21|) 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_21|) 4)))) (or (and (= (store |v_#memory_int_87| |v_ULTIMATE.start_sll_insert_~head#1.base_16| (store (select |v_#memory_int_87| |v_ULTIMATE.start_sll_insert_~head#1.base_16|) 0 (select (select |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~head#1.base_16|) 0))) |v_#memory_int_39|) (= (store |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_insert_~head#1.base_16| (store (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_insert_~head#1.base_16|) 0 |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_21|)) |v_#memory_$Pointer$.base_38|) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_21| 0) (= (store |v_#memory_$Pointer$.offset_77| |v_ULTIMATE.start_sll_insert_~head#1.base_16| (store (select |v_#memory_$Pointer$.offset_77| |v_ULTIMATE.start_sll_insert_~head#1.base_16|) 0 0)) |v_#memory_$Pointer$.offset_38|) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_21| 0)) (and (= (store |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_21| (store (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_21|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_21| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_21|)) |v_#memory_$Pointer$.base_38|) (= (store |v_#memory_$Pointer$.offset_77| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_21| (store (select |v_#memory_$Pointer$.offset_77| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_21|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_21| 4) 0)) |v_#memory_$Pointer$.offset_38|) (or (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_21| 0)) (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_21| 0))) (= |v_#memory_int_39| (store |v_#memory_int_87| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_21| (store (select |v_#memory_int_87| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_21|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_21| 4) (select (select |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_21|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_21| 4))))))) (<= 2 |v_ULTIMATE.start_sll_insert_~head#1.base_16|) (= |#memory_int| (store |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_21| (store (select |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_21|) 4 (select (select |#memory_int| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_21|) 4)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_21| (store (select |v_#memory_$Pointer$.base_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_21|) 4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_21|) 4)))))) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 04:34:59,213 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:34:59,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:34:59,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-09 04:34:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941488772] [2024-11-09 04:34:59,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:34:59,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:34:59,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:34:59,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:34:59,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=333, Unknown=1, NotChecked=0, Total=380 [2024-11-09 04:34:59,216 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 04:34:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:34:59,312 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2024-11-09 04:34:59,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:34:59,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 22 [2024-11-09 04:34:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:34:59,315 INFO L225 Difference]: With dead ends: 44 [2024-11-09 04:34:59,315 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 04:34:59,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=46, Invalid=333, Unknown=1, NotChecked=0, Total=380 [2024-11-09 04:34:59,317 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:34:59,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:34:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 04:34:59,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 04:34:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:34:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-09 04:34:59,332 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 22 [2024-11-09 04:34:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:34:59,332 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-09 04:34:59,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 04:34:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-09 04:34:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 04:34:59,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:34:59,334 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:34:59,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:34:59,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:34:59,535 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:34:59,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:34:59,536 INFO L85 PathProgramCache]: Analyzing trace with hash 430262125, now seen corresponding path program 2 times [2024-11-09 04:34:59,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:34:59,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948916880] [2024-11-09 04:34:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:34:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:35:00,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:35:00,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948916880] [2024-11-09 04:35:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948916880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:35:00,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89890303] [2024-11-09 04:35:00,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:35:00,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:35:00,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:35:00,866 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:35:00,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:35:01,059 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 04:35:01,060 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:35:01,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 04:35:01,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:01,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 04:35:01,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:01,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 04:35:01,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:35:02,019 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 04:35:02,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 112 [2024-11-09 04:35:02,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:02,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 98 [2024-11-09 04:35:02,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:02,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 89 [2024-11-09 04:35:02,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:02,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 128 [2024-11-09 04:35:02,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:35:02,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 118 [2024-11-09 04:35:02,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 74 [2024-11-09 04:35:02,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:35:02,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:35:02,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:02,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 86 [2024-11-09 04:35:03,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:03,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 236 [2024-11-09 04:35:03,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 222 [2024-11-09 04:35:03,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 218 [2024-11-09 04:35:03,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 214 [2024-11-09 04:35:03,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 210 [2024-11-09 04:35:03,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 208 [2024-11-09 04:35:04,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-09 04:35:04,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 04:35:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89890303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:35:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [712046519] [2024-11-09 04:35:04,567 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 04:35:04,568 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:35:04,569 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:35:04,570 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:35:04,570 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:35:05,517 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 129 for LOIs [2024-11-09 04:35:05,692 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:35:14,329 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '745#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_#memory_int_107| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_24| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| Int) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| Int) (|v_#memory_$Pointer$.base_38| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~head#1.base_18| Int) (|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_38| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_24| (store (select |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_24|) 4 (select (select |#memory_int| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_24|) 4)))) (<= 2 |v_ULTIMATE.start_sll_insert_~head#1.base_18|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_24| (store (select |v_#memory_$Pointer$.offset_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_24|) 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_24|) 4)))) (or (and (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| 0) (= (store |v_#memory_$Pointer$.offset_95| |v_ULTIMATE.start_sll_insert_~head#1.base_18| (store (select |v_#memory_$Pointer$.offset_95| |v_ULTIMATE.start_sll_insert_~head#1.base_18|) 0 0)) |v_#memory_$Pointer$.offset_38|) (= (store |v_#memory_int_107| |v_ULTIMATE.start_sll_insert_~head#1.base_18| (store (select |v_#memory_int_107| |v_ULTIMATE.start_sll_insert_~head#1.base_18|) 0 (select (select |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~head#1.base_18|) 0))) |v_#memory_int_39|) (= |v_#memory_$Pointer$.base_38| (store |v_#memory_$Pointer$.base_95| |v_ULTIMATE.start_sll_insert_~head#1.base_18| (store (select |v_#memory_$Pointer$.base_95| |v_ULTIMATE.start_sll_insert_~head#1.base_18|) 0 |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_24|))) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| 0)) (and (= |v_#memory_int_39| (store |v_#memory_int_107| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| (store (select |v_#memory_int_107| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| 4) (select (select |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| 4))))) (= |v_#memory_$Pointer$.base_38| (store |v_#memory_$Pointer$.base_95| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| (store (select |v_#memory_$Pointer$.base_95| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_24|))) (or (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| 0)) (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| 0))) (= (store |v_#memory_$Pointer$.offset_95| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_95| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| 4) 0)) |v_#memory_$Pointer$.offset_38|))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_24| (store (select |v_#memory_$Pointer$.base_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_24|) 4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_24|) 4)))))) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 04:35:14,329 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:35:14,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:35:14,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2024-11-09 04:35:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378364338] [2024-11-09 04:35:14,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:35:14,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 04:35:14,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:35:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 04:35:14,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2298, Unknown=9, NotChecked=0, Total=2450 [2024-11-09 04:35:14,333 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 31 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 04:35:16,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:16,024 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2024-11-09 04:35:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 04:35:16,024 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2024-11-09 04:35:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:16,025 INFO L225 Difference]: With dead ends: 35 [2024-11-09 04:35:16,025 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 04:35:16,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=266, Invalid=3757, Unknown=9, NotChecked=0, Total=4032 [2024-11-09 04:35:16,028 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 78 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:35:16,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 332 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 04:35:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 04:35:16,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-09 04:35:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:35:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-09 04:35:16,041 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 29 [2024-11-09 04:35:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:16,041 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-09 04:35:16,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 04:35:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-09 04:35:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 04:35:16,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:16,043 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:16,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 04:35:16,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:35:16,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:16,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:16,248 INFO L85 PathProgramCache]: Analyzing trace with hash 452855228, now seen corresponding path program 1 times [2024-11-09 04:35:16,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:35:16,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975807595] [2024-11-09 04:35:16,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:16,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:35:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:35:18,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:35:18,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975807595] [2024-11-09 04:35:18,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975807595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:35:18,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372121512] [2024-11-09 04:35:18,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:18,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:35:18,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:35:18,198 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:35:18,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 04:35:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:18,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-09 04:35:18,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:18,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:35:18,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 04:35:18,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 04:35:18,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-09 04:35:18,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 04:35:18,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 04:35:18,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 04:35:19,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:19,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 04:35:19,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:19,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-11-09 04:35:19,181 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 04:35:19,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-09 04:35:19,210 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 04:35:19,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 04:35:19,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:19,719 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-11-09 04:35:19,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 80 [2024-11-09 04:35:19,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 55 [2024-11-09 04:35:19,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:19,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 04:35:19,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:19,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:19,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 04:35:19,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 04:35:19,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 04:35:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:35:19,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:35:20,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0)) (.cse0 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0))) (and (or (not .cse0) (not .cse1) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_536) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2)) (= .cse2 0)))) (forall ((v_prenex_40 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_38) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse4 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_40) .cse4) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (or (let ((.cse7 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|)) (.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (and (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_DerPreprocessor_20 Int)) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_41) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse5 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store .cse6 .cse7 v_DerPreprocessor_20)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_43) .cse5) (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_42) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_20 Int)) (let ((.cse9 (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store .cse6 .cse7 v_DerPreprocessor_20)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_536) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse9)) (= .cse9 0))))))) (and .cse1 .cse0)))) is different from false [2024-11-09 04:35:20,276 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| 0)) (.cse1 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 0))) (and (or (not .cse0) (not .cse1) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_536) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2)) (= .cse2 0)))) (forall ((v_prenex_40 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_38) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse4 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_40) .cse4) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (or (and .cse0 .cse1) (let ((.cse6 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|)) (.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (and (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_DerPreprocessor_20 Int)) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_41) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store .cse5 .cse6 v_DerPreprocessor_20)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_43) .cse7) (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_42) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse7 0)))) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_20 Int)) (let ((.cse9 (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store .cse5 .cse6 v_DerPreprocessor_20)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_536) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse9)) (= .cse9 0)))))))))) is different from false [2024-11-09 04:35:20,420 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse12 (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse4 (= .cse12 0)) (.cse5 (= .cse6 0))) (and (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_insert_~head#1.offset| |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))) (and (forall ((v_prenex_40 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_prenex_38) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_prenex_40) .cse0) (select (select (store .cse1 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 0)))) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse2 (select (select (store .cse1 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse2 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_536) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2))))))) (not .cse4) (not .cse5)) (or (and .cse4 .cse5) (let ((.cse8 (+ .cse12 4))) (let ((.cse7 (select |c_#memory_int| .cse6)) (.cse10 (store |c_#memory_$Pointer$.offset| .cse6 (store (select |c_#memory_$Pointer$.offset| .cse6) .cse8 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))) (and (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_20 Int)) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse6 (store .cse7 .cse8 v_DerPreprocessor_20)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_536) (select (select (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_19) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse9)) (= .cse9 0)))) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_DerPreprocessor_20 Int)) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_19) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_prenex_41) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse6 (store .cse7 .cse8 v_DerPreprocessor_20)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_prenex_43) .cse11) (select (select (store .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_prenex_42) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse11 0)))))))))))) is different from false [2024-11-09 04:35:22,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372121512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:35:22,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [192185342] [2024-11-09 04:35:22,491 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 04:35:22,491 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:35:22,492 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:35:22,492 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:35:22,492 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:35:23,490 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 129 for LOIs [2024-11-09 04:35:23,611 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:35:36,186 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1030#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_20| Int) (|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_27| Int) (|v_#memory_$Pointer$.base_38| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| Int) (|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_113| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32| Int) (|v_#memory_$Pointer$.offset_38| (Array Int (Array Int Int))) (|v_#memory_int_135| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_113| (Array Int (Array Int Int)))) (and (or (and (= |v_#memory_int_39| (store |v_#memory_int_135| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_int_135| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4) (select (select |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4))))) (= (store |v_#memory_$Pointer$.offset_113| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_$Pointer$.offset_113| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4) 0)) |v_#memory_$Pointer$.offset_38|) (= |v_#memory_$Pointer$.base_38| (store |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_27|))) (or (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 0)) (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32| 0)))) (and (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32| 0) (= (store |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_sll_insert_~head#1.base_20| (store (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_sll_insert_~head#1.base_20|) 0 |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_27|)) |v_#memory_$Pointer$.base_38|) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 0) (= |v_#memory_$Pointer$.offset_38| (store |v_#memory_$Pointer$.offset_113| |v_ULTIMATE.start_sll_insert_~head#1.base_20| (store (select |v_#memory_$Pointer$.offset_113| |v_ULTIMATE.start_sll_insert_~head#1.base_20|) 0 0))) (= |v_#memory_int_39| (store |v_#memory_int_135| |v_ULTIMATE.start_sll_insert_~head#1.base_20| (store (select |v_#memory_int_135| |v_ULTIMATE.start_sll_insert_~head#1.base_20|) 0 (select (select |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~head#1.base_20|) 0)))))) (= |#memory_int| (store |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_27| (store (select |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_27|) 4 (select (select |#memory_int| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_27|) 4)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_27| (store (select |v_#memory_$Pointer$.base_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_27|) 4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_27|) 4)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_27| (store (select |v_#memory_$Pointer$.offset_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_27|) 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_27|) 4)))) (<= 2 |v_ULTIMATE.start_sll_insert_~head#1.base_20|))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) |ULTIMATE.start_main_~temp~2#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 04:35:36,187 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:35:36,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:35:36,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2024-11-09 04:35:36,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193312925] [2024-11-09 04:35:36,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:35:36,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 04:35:36,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:35:36,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 04:35:36,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1868, Unknown=4, NotChecked=264, Total=2256 [2024-11-09 04:35:36,189 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 27 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 04:35:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:37,495 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-09 04:35:37,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 04:35:37,495 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2024-11-09 04:35:37,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:37,496 INFO L225 Difference]: With dead ends: 35 [2024-11-09 04:35:37,496 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 04:35:37,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=144, Invalid=2216, Unknown=4, NotChecked=288, Total=2652 [2024-11-09 04:35:37,497 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:35:37,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 250 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 04:35:37,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 04:35:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 04:35:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:35:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-09 04:35:37,509 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 30 [2024-11-09 04:35:37,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:37,509 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-09 04:35:37,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 04:35:37,509 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-11-09 04:35:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 04:35:37,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:37,511 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:37,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 04:35:37,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:35:37,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:37,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:37,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1343916136, now seen corresponding path program 3 times [2024-11-09 04:35:37,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:35:37,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032329353] [2024-11-09 04:35:37,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:37,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:35:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 04:35:37,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:35:37,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032329353] [2024-11-09 04:35:37,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032329353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:35:37,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410414185] [2024-11-09 04:35:37,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 04:35:37,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:35:37,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:35:37,958 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:35:37,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 04:35:38,655 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 04:35:38,655 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:35:38,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 04:35:38,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 04:35:38,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:35:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 04:35:38,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410414185] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 04:35:38,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:35:38,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 12 [2024-11-09 04:35:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436840375] [2024-11-09 04:35:38,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:35:38,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:35:38,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:35:38,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:35:38,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:35:38,917 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:35:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:39,006 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-09 04:35:39,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:35:39,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2024-11-09 04:35:39,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:39,011 INFO L225 Difference]: With dead ends: 45 [2024-11-09 04:35:39,011 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 04:35:39,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:35:39,013 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:35:39,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:35:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 04:35:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-09 04:35:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:35:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-09 04:35:39,027 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 31 [2024-11-09 04:35:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:39,028 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-09 04:35:39,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:35:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 04:35:39,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 04:35:39,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:39,030 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:39,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 04:35:39,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 04:35:39,231 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:39,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:39,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1402218614, now seen corresponding path program 1 times [2024-11-09 04:35:39,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:35:39,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974104014] [2024-11-09 04:35:39,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:39,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:35:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:35:41,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:35:41,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974104014] [2024-11-09 04:35:41,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974104014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:35:41,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141344165] [2024-11-09 04:35:41,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:41,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:35:41,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:35:41,023 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:35:41,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 04:35:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:41,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-09 04:35:41,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:41,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:35:41,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:35:41,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:41,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 17 [2024-11-09 04:35:41,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 04:35:42,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:42,203 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 04:35:42,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 35 [2024-11-09 04:35:42,220 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 04:35:42,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 04:35:42,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:42,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 04:35:42,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:42,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 54 [2024-11-09 04:35:42,838 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 04:35:42,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 81 [2024-11-09 04:35:42,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-11-09 04:35:42,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:42,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:42,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-09 04:35:42,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:42,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 24 [2024-11-09 04:35:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 04:35:43,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:35:43,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:43,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 95 [2024-11-09 04:35:44,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141344165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:35:44,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [787284944] [2024-11-09 04:35:44,219 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-09 04:35:44,219 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:35:44,219 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:35:44,219 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:35:44,219 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:35:45,186 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 129 for LOIs [2024-11-09 04:35:45,328 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:35:56,911 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1611#(exists ((|v_ULTIMATE.start_main_~len~0#1_15| Int) (|v_ULTIMATE.start_main_~count~0#1_28| Int)) (and (or (and (exists ((|v_#memory_$Pointer$.offset_148| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~head#1.base_23| Int) (|v_#memory_$Pointer$.base_149| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_42| Int) (|v_#memory_$Pointer$.base_38| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_38| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_42| Int) (|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32| Int)) (and (= |#memory_int| (store |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32| (store (select |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|) 4 (select (select |#memory_int| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|) 4)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32| (store (select |v_#memory_$Pointer$.offset_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|) 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|) 4)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32| (store (select |v_#memory_$Pointer$.base_38| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|) 4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|) 4)))) (<= 2 |v_ULTIMATE.start_sll_insert_~head#1.base_23|) (or (and (= (store |v_#memory_$Pointer$.offset_148| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_42| (store (select |v_#memory_$Pointer$.offset_148| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_42|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_42| 4) 0)) |v_#memory_$Pointer$.offset_38|) (= |v_#memory_$Pointer$.base_38| (store |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_42| (store (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_42|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_42| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|))) (or (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_42| 0)) (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_42| 0))) (= (store |v_#memory_int_178| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_42| (store (select |v_#memory_int_178| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_42|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_42| 4) (select (select |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_42|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_42| 4)))) |v_#memory_int_39|)) (and (= |v_#memory_int_39| (store |v_#memory_int_178| |v_ULTIMATE.start_sll_insert_~head#1.base_23| (store (select |v_#memory_int_178| |v_ULTIMATE.start_sll_insert_~head#1.base_23|) 0 (select (select |v_#memory_int_39| |v_ULTIMATE.start_sll_insert_~head#1.base_23|) 0)))) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_42| 0) (= (store |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_sll_insert_~head#1.base_23| (store (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_sll_insert_~head#1.base_23|) 0 |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|)) |v_#memory_$Pointer$.base_38|) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_42| 0) (= (store |v_#memory_$Pointer$.offset_148| |v_ULTIMATE.start_sll_insert_~head#1.base_23| (store (select |v_#memory_$Pointer$.offset_148| |v_ULTIMATE.start_sll_insert_~head#1.base_23|) 0 0)) |v_#memory_$Pointer$.offset_38|))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (< 0 |v_ULTIMATE.start_main_~count~0#1_28|)) (or (and (= |v_ULTIMATE.start_main_~len~0#1_15| 2) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |v_ULTIMATE.start_main_~count~0#1_28| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|)) (and (= |v_ULTIMATE.start_main_~len~0#1_15| 2) (<= 1 |#StackHeapBarrier|) (<= 1 |v_ULTIMATE.start_main_~count~0#1_28|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))) (not (= (+ |v_ULTIMATE.start_main_~len~0#1_15| 1) |v_ULTIMATE.start_main_~count~0#1_28|))))' at error location [2024-11-09 04:35:56,912 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:35:56,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:35:56,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 33 [2024-11-09 04:35:56,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497952912] [2024-11-09 04:35:56,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:35:56,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 04:35:56,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:35:56,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 04:35:56,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2673, Unknown=19, NotChecked=0, Total=2862 [2024-11-09 04:35:56,915 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 33 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 27 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 04:35:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:58,288 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-11-09 04:35:58,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 04:35:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 27 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2024-11-09 04:35:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:58,291 INFO L225 Difference]: With dead ends: 36 [2024-11-09 04:35:58,291 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 04:35:58,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=261, Invalid=4142, Unknown=19, NotChecked=0, Total=4422 [2024-11-09 04:35:58,294 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:35:58,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 288 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:35:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 04:35:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2024-11-09 04:35:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:35:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-09 04:35:58,307 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 32 [2024-11-09 04:35:58,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:58,308 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-09 04:35:58,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 27 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 04:35:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-09 04:35:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 04:35:58,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:58,309 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:58,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 04:35:58,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:35:58,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:58,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash 518735315, now seen corresponding path program 1 times [2024-11-09 04:35:58,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:35:58,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360720946] [2024-11-09 04:35:58,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:58,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:35:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:36:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:36:01,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:36:01,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360720946] [2024-11-09 04:36:01,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360720946] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:36:01,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52961585] [2024-11-09 04:36:01,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:36:01,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:36:01,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:36:01,769 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:36:01,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5a04c94-c70d-4db9-9d34-671e442f8182/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 04:36:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:36:01,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 150 conjuncts are in the unsatisfiable core [2024-11-09 04:36:01,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:36:02,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:36:02,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 04:36:02,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 04:36:02,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 04:36:02,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 04:36:02,701 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 04:36:02,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 04:36:02,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:36:02,752 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 04:36:02,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 04:36:02,921 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 04:36:02,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-11-09 04:36:02,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 04:36:02,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:36:03,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:36:03,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 41 [2024-11-09 04:36:03,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 04:36:03,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:03,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 04:36:03,362 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:36:03,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 04:36:03,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-09 04:36:03,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:03,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2024-11-09 04:36:03,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:03,587 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 04:36:03,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 69 [2024-11-09 04:36:03,620 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-11-09 04:36:03,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 04:36:03,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:03,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:03,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-09 04:36:04,397 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-09 04:36:04,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 139 [2024-11-09 04:36:04,443 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2024-11-09 04:36:04,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 298 treesize of output 217 [2024-11-09 04:36:04,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:04,475 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-09 04:36:04,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 66 [2024-11-09 04:36:04,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:04,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:36:04,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 32 [2024-11-09 04:36:04,541 INFO L349 Elim1Store]: treesize reduction 33, result has 38.9 percent of original size [2024-11-09 04:36:04,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 53 [2024-11-09 04:36:05,589 INFO L349 Elim1Store]: treesize reduction 72, result has 72.0 percent of original size [2024-11-09 04:36:05,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 338 treesize of output 355 [2024-11-09 04:36:06,061 INFO L349 Elim1Store]: treesize reduction 72, result has 72.0 percent of original size [2024-11-09 04:36:06,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 166 treesize of output 310 [2024-11-09 04:37:11,467 INFO L349 Elim1Store]: treesize reduction 161, result has 82.0 percent of original size [2024-11-09 04:37:11,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 278 treesize of output 921