./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 cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX --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.3-dev-cf1a783 [2023-11-12 00:08:56,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:08:56,452 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:08:56,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:08:56,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:08:56,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:08:56,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:08:56,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:08:56,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:08:56,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:08:56,511 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:08:56,512 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:08:56,513 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:08:56,515 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:08:56,515 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:08:56,516 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:08:56,516 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:08:56,517 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:08:56,517 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:08:56,519 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:08:56,520 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:08:56,521 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:08:56,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:08:56,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:08:56,523 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:08:56,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:08:56,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:08:56,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:08:56,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:08:56,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:08:56,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:08:56,527 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:08:56,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:08:56,528 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:08:56,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:08:56,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:08:56,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:08:56,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:08:56,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:08:56,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:08:56,531 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:08:56,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:08:56,531 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:08:56,531 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:08:56,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:08:56,532 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_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/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_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX 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 [2023-11-12 00:08:56,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:08:56,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:08:56,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:08:56,906 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:08:56,907 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:08:56,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-11-12 00:09:00,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:09:00,289 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:09:00,290 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-11-12 00:09:00,314 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/data/e0e14e8c6/4c7cfa3812ee4b6a85ea313952f54696/FLAGea50e9e4a [2023-11-12 00:09:00,330 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/data/e0e14e8c6/4c7cfa3812ee4b6a85ea313952f54696 [2023-11-12 00:09:00,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:09:00,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:09:00,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:09:00,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:09:00,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:09:00,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:09:00" (1/1) ... [2023-11-12 00:09:00,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314949ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00, skipping insertion in model container [2023-11-12 00:09:00,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:09:00" (1/1) ... [2023-11-12 00:09:00,400 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:09:00,796 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2023-11-12 00:09:00,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:09:00,820 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:09:00,878 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2023-11-12 00:09:00,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:09:00,915 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:09:00,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00 WrapperNode [2023-11-12 00:09:00,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:09:00,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:09:00,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:09:00,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:09:00,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00" (1/1) ... [2023-11-12 00:09:00,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00" (1/1) ... [2023-11-12 00:09:00,969 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2023-11-12 00:09:00,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:09:00,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:09:00,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:09:00,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:09:00,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00" (1/1) ... [2023-11-12 00:09:00,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00" (1/1) ... [2023-11-12 00:09:00,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00" (1/1) ... [2023-11-12 00:09:00,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00" (1/1) ... [2023-11-12 00:09:00,996 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00" (1/1) ... [2023-11-12 00:09:01,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00" (1/1) ... [2023-11-12 00:09:01,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00" (1/1) ... [2023-11-12 00:09:01,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00" (1/1) ... [2023-11-12 00:09:01,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:09:01,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:09:01,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:09:01,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:09:01,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00" (1/1) ... [2023-11-12 00:09:01,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:09:01,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:09:01,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:09:01,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:09:01,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:09:01,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:09:01,097 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:09:01,097 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:09:01,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:09:01,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:09:01,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:09:01,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:09:01,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:09:01,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:09:01,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:09:01,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:09:01,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:09:01,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:09:01,275 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:09:01,277 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:09:01,614 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:09:01,723 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:09:01,723 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 00:09:01,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:09:01 BoogieIcfgContainer [2023-11-12 00:09:01,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:09:01,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:09:01,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:09:01,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:09:01,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:09:00" (1/3) ... [2023-11-12 00:09:01,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8a4c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:09:01, skipping insertion in model container [2023-11-12 00:09:01,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:00" (2/3) ... [2023-11-12 00:09:01,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8a4c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:09:01, skipping insertion in model container [2023-11-12 00:09:01,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:09:01" (3/3) ... [2023-11-12 00:09:01,744 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2023-11-12 00:09:01,789 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:09:01,793 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 00:09:01,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:09:01,890 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@74f59a84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:09:01,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 00:09:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:09:01,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:09:01,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:09:01,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:09:01,908 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:09:01,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:09:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash -840701354, now seen corresponding path program 1 times [2023-11-12 00:09:01,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:09:01,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160407571] [2023-11-12 00:09:01,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:09:01,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:09:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:09:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:09:02,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:09:02,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160407571] [2023-11-12 00:09:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160407571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:09:02,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:09:02,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:09:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374093260] [2023-11-12 00:09:02,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:09:02,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:09:02,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:09:02,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:09:02,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:09:02,467 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-11-12 00:09:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:09:02,532 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2023-11-12 00:09:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:09:02,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2023-11-12 00:09:02,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:09:02,543 INFO L225 Difference]: With dead ends: 37 [2023-11-12 00:09:02,543 INFO L226 Difference]: Without dead ends: 18 [2023-11-12 00:09:02,546 INFO L412 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 [2023-11-12 00:09:02,551 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:09:02,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:09:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-12 00:09:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-11-12 00:09:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:09:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-11-12 00:09:02,598 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2023-11-12 00:09:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:09:02,599 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-11-12 00:09:02,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-11-12 00:09:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2023-11-12 00:09:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:09:02,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:09:02,602 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:09:02,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:09:02,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:09:02,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:09:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash 119792004, now seen corresponding path program 1 times [2023-11-12 00:09:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:09:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300734641] [2023-11-12 00:09:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:09:02,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:09:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:09:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:09:02,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:09:02,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300734641] [2023-11-12 00:09:02,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300734641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:09:02,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840861317] [2023-11-12 00:09:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:09:02,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:09:02,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:09:02,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:09:02,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:09:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:09:02,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:09:02,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:09:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:09:03,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:09:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:09:03,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840861317] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:09:03,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [209206349] [2023-11-12 00:09:03,163 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:09:03,163 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:09:03,167 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:09:03,173 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:09:03,174 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:09:05,392 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-11-12 00:09:05,735 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:09:11,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [209206349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:09:11,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:09:11,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 4, 4] total 14 [2023-11-12 00:09:11,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763020379] [2023-11-12 00:09:11,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:09:11,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:09:11,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:09:11,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:09:11,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=151, Unknown=1, NotChecked=0, Total=182 [2023-11-12 00:09:11,024 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:09:13,354 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] [2023-11-12 00:09:15,459 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] [2023-11-12 00:09:17,510 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] [2023-11-12 00:09:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:09:18,490 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2023-11-12 00:09:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:09:18,494 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 17 [2023-11-12 00:09:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:09:18,495 INFO L225 Difference]: With dead ends: 22 [2023-11-12 00:09:18,495 INFO L226 Difference]: Without dead ends: 17 [2023-11-12 00:09:18,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=30, Invalid=151, Unknown=1, NotChecked=0, Total=182 [2023-11-12 00:09:18,497 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:09:18,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 5 Unknown, 0 Unchecked, 7.4s Time] [2023-11-12 00:09:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-12 00:09:18,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-12 00:09:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:09:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-12 00:09:18,508 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 17 [2023-11-12 00:09:18,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:09:18,509 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-12 00:09:18,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:09:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-11-12 00:09:18,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:09:18,510 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:09:18,510 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:09:18,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 00:09:18,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-12 00:09:18,717 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:09:18,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:09:18,718 INFO L85 PathProgramCache]: Analyzing trace with hash -657117681, now seen corresponding path program 1 times [2023-11-12 00:09:18,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:09:18,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518032254] [2023-11-12 00:09:18,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:09:18,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:09:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:09:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:09:18,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:09:18,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518032254] [2023-11-12 00:09:18,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518032254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:09:18,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008301150] [2023-11-12 00:09:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:09:18,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:09:18,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:09:18,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:09:18,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:09:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:09:19,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:09:19,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:09:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:09:19,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:09:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:09:19,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008301150] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:09:19,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1910362283] [2023-11-12 00:09:19,055 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:09:19,055 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:09:19,055 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:09:19,056 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:09:19,056 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:09:20,542 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-11-12 00:09:20,816 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:09:24,674 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '372#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (exists ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_28| Int) (|v_#memory_int_97| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~head#1.base_23| Int) (|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_28| Int) (|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| Int) (|v_#memory_int_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_90| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_49| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_28| (store (select |v_#memory_int_49| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_28|) 4 (select (select |#memory_int| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_28|) 4))) |#memory_int|) (<= 2 |v_ULTIMATE.start_sll_insert_~head#1.base_23|) (= (store |v_#memory_$Pointer$.base_51| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.base_51| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_28|) 4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_28|) 4))) |#memory_$Pointer$.base|) (or (and (or (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_28| 0)) (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| 0))) (= |v_#memory_int_49| (store |v_#memory_int_97| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_28| (store (select |v_#memory_int_97| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_28|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| 4) (select (select |v_#memory_int_49| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_28|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| 4))))) (= (store |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_28| (store (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_28|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_28|)) |v_#memory_$Pointer$.base_51|) (= (store |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_28| (store (select |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_28|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| 4) 0)) |v_#memory_$Pointer$.offset_51|)) (and (= (store |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_insert_~head#1.base_23| (store (select |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_insert_~head#1.base_23|) 0 0)) |v_#memory_$Pointer$.offset_51|) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_28| 0) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| 0) (= (store |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_insert_~head#1.base_23| (store (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_insert_~head#1.base_23|) 0 |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_28|)) |v_#memory_$Pointer$.base_51|) (= (store |v_#memory_int_97| |v_ULTIMATE.start_sll_insert_~head#1.base_23| (store (select |v_#memory_int_97| |v_ULTIMATE.start_sll_insert_~head#1.base_23|) 0 (select (select |v_#memory_int_49| |v_ULTIMATE.start_sll_insert_~head#1.base_23|) 0))) |v_#memory_int_49|))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_51| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_28| (store (select |v_#memory_$Pointer$.offset_51| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_28|) 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_28|) 4)))))) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:09:24,675 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:09:24,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:09:24,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-12 00:09:24,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601352063] [2023-11-12 00:09:24,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:09:24,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:09:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:09:24,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:09:24,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=231, Unknown=1, NotChecked=0, Total=272 [2023-11-12 00:09:24,678 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2023-11-12 00:09:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:09:24,755 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2023-11-12 00:09:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:09:24,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 18 [2023-11-12 00:09:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:09:24,757 INFO L225 Difference]: With dead ends: 32 [2023-11-12 00:09:24,757 INFO L226 Difference]: Without dead ends: 20 [2023-11-12 00:09:24,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=40, Invalid=231, Unknown=1, NotChecked=0, Total=272 [2023-11-12 00:09:24,764 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:09:24,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:09:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-12 00:09:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-12 00:09:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:09:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-11-12 00:09:24,785 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 18 [2023-11-12 00:09:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:09:24,785 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-12 00:09:24,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2023-11-12 00:09:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-11-12 00:09:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:09:24,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:09:24,788 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:09:24,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-12 00:09:24,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-12 00:09:24,995 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:09:24,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:09:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2004313889, now seen corresponding path program 2 times [2023-11-12 00:09:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:09:24,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909475633] [2023-11-12 00:09:24,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:09:24,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:09:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:09:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:09:27,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:09:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909475633] [2023-11-12 00:09:27,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909475633] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:09:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295374588] [2023-11-12 00:09:27,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:09:27,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:09:27,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:09:27,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:09:27,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:09:27,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-12 00:09:27,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:09:27,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 122 conjunts are in the unsatisfiable core [2023-11-12 00:09:27,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:09:27,975 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:09:28,035 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:09:28,228 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 00:09:28,453 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-11-12 00:09:28,459 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 00:09:28,464 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:09:28,470 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 00:09:28,570 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-12 00:09:28,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:28,721 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-11-12 00:09:28,742 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-12 00:09:28,743 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 15 [2023-11-12 00:09:28,758 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-12 00:09:28,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:28,780 INFO L351 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 [2023-11-12 00:09:29,400 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:09:29,401 INFO L351 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 114 treesize of output 123 [2023-11-12 00:09:29,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:29,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:29,437 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 127 [2023-11-12 00:09:29,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:29,467 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 85 [2023-11-12 00:09:29,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:29,727 INFO L322 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-12 00:09:29,727 INFO L351 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 213 [2023-11-12 00:09:29,738 INFO L351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 170 [2023-11-12 00:09:29,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:30,130 INFO L322 Elim1Store]: treesize reduction 242, result has 21.2 percent of original size [2023-11-12 00:09:30,131 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 237 treesize of output 347 [2023-11-12 00:09:31,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:31,522 INFO L322 Elim1Store]: treesize reduction 323, result has 13.4 percent of original size [2023-11-12 00:09:31,523 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 380 treesize of output 458 [2023-11-12 00:09:33,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:33,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:33,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:33,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:33,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:33,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:33,187 INFO L322 Elim1Store]: treesize reduction 126, result has 22.7 percent of original size [2023-11-12 00:09:33,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 292 treesize of output 312 [2023-11-12 00:09:33,212 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-12 00:09:33,253 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-11-12 00:09:33,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:33,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:33,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:33,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:33,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:33,304 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 50 [2023-11-12 00:09:33,311 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-11-12 00:09:33,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-11-12 00:09:33,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:33,581 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-12 00:09:33,582 INFO L351 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 901 treesize of output 909 [2023-11-12 00:09:33,623 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 845 treesize of output 843 [2023-11-12 00:09:33,695 INFO L351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-12 00:09:34,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:09:34,253 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-12 00:09:34,253 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 991 treesize of output 963 [2023-11-12 00:09:34,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 762 treesize of output 530 [2023-11-12 00:09:35,280 INFO L322 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-11-12 00:09:35,282 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3307 treesize of output 3007 [2023-11-12 00:09:35,313 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 114 [2023-11-12 00:09:35,327 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 109 [2023-11-12 00:09:35,455 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-12 00:09:35,525 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-12 00:09:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:09:35,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:09:35,816 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse3 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_31))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_381) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| (store (select |c_#memory_$Pointer$.base| |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.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (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|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_383) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_381 (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_381 .cse1))))))) (not .cse2) (not .cse3)) (or (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_DerPreprocessor_30 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) v_DerPreprocessor_30)))) (or (not (= v_ArrVal_381 (store (select .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_381 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_381) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_383) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (and .cse3 .cse2)))) is different from false [2023-11-12 00:09:35,863 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| 0)) (.cse3 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse1 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 0))) (and (or (and .cse0 .cse1) (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_DerPreprocessor_30 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4) v_DerPreprocessor_30)))) (or (not (= v_ArrVal_381 (store (select .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_381 .cse3)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_381) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_383) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (not .cse0) (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_31))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_381) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| (store (select |c_#memory_$Pointer$.base| |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.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (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|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_383) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_381 (store (select .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_381 .cse3))))))) (not .cse1)))) is different from false [2023-11-12 00:09:35,916 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse0 (= .cse5 0)) (.cse3 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse1 (= .cse4 0))) (and (or (and .cse0 .cse1) (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_DerPreprocessor_30 Int)) (let ((.cse2 (store |c_#memory_int| .cse4 (store (select |c_#memory_int| .cse4) (+ .cse5 4) v_DerPreprocessor_30)))) (or (not (= v_ArrVal_381 (store (select .cse2 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse3 (select v_ArrVal_381 .cse3)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_381) (select (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_28) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_DerPreprocessor_29) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_383) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (not .cse0) (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_31))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_381) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_insert_~head#1.offset| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_insert_~head#1.offset| |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_383) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_381 (store (select .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse3 (select v_ArrVal_381 .cse3))))))) (not .cse1)))))) is different from false [2023-11-12 00:09:36,167 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:09:36,168 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 250 treesize of output 245 [2023-11-12 00:09:36,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295374588] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:09:36,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [90327739] [2023-11-12 00:09:36,982 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:09:36,982 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:09:36,983 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:09:36,983 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:09:36,983 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:09:38,414 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-11-12 00:09:38,684 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:09:46,824 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '584#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_108| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~head#1.base_25| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| Int) (|v_#memory_int_49| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33| Int) (|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_31| Int)) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_51| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.base_51| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_31|) 4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_31|) 4)))) (or (and (= (store |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33| (store (select |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 4) 0)) |v_#memory_$Pointer$.offset_51|) (or (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 0)) (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33| 0))) (= |v_#memory_int_49| (store |v_#memory_int_125| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33| (store (select |v_#memory_int_125| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 4) (select (select |v_#memory_int_49| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 4))))) (= (store |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33| (store (select |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_31|)) |v_#memory_$Pointer$.base_51|)) (and (= (store |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_sll_insert_~head#1.base_25| (store (select |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_sll_insert_~head#1.base_25|) 0 0)) |v_#memory_$Pointer$.offset_51|) (= (store |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_insert_~head#1.base_25| (store (select |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_insert_~head#1.base_25|) 0 |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_31|)) |v_#memory_$Pointer$.base_51|) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_33| 0) (= (store |v_#memory_int_125| |v_ULTIMATE.start_sll_insert_~head#1.base_25| (store (select |v_#memory_int_125| |v_ULTIMATE.start_sll_insert_~head#1.base_25|) 0 (select (select |v_#memory_int_49| |v_ULTIMATE.start_sll_insert_~head#1.base_25|) 0))) |v_#memory_int_49|) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_33| 0))) (= |#memory_int| (store |v_#memory_int_49| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_31| (store (select |v_#memory_int_49| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_31|) 4 (select (select |#memory_int| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_31|) 4)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_51| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_51| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_31|) 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_31|) 4)))) (<= 2 |v_ULTIMATE.start_sll_insert_~head#1.base_25|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:09:46,824 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:09:46,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:09:46,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2023-11-12 00:09:46,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3490538] [2023-11-12 00:09:46,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:09:46,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-12 00:09:46,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:09:46,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-12 00:09:46,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1620, Unknown=4, NotChecked=246, Total=1980 [2023-11-12 00:09:46,830 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 29 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:09:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:09:49,033 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2023-11-12 00:09:49,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 00:09:49,034 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-11-12 00:09:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:09:49,035 INFO L225 Difference]: With dead ends: 26 [2023-11-12 00:09:49,035 INFO L226 Difference]: Without dead ends: 23 [2023-11-12 00:09:49,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=161, Invalid=2397, Unknown=4, NotChecked=300, Total=2862 [2023-11-12 00:09:49,038 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:09:49,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 116 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-12 00:09:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-12 00:09:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-12 00:09:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:09:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-12 00:09:49,052 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 24 [2023-11-12 00:09:49,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:09:49,052 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-12 00:09:49,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:09:49,052 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-12 00:09:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 00:09:49,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:09:49,054 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:09:49,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-12 00:09:49,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-12 00:09:49,260 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:09:49,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:09:49,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1928485906, now seen corresponding path program 3 times [2023-11-12 00:09:49,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:09:49,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108901045] [2023-11-12 00:09:49,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:09:49,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:09:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:09:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:09:49,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:09:49,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108901045] [2023-11-12 00:09:49,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108901045] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:09:49,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439832412] [2023-11-12 00:09:49,543 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 00:09:49,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:09:49,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:09:49,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:09:49,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:09:50,263 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 00:09:50,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:09:50,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-12 00:09:50,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:09:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:09:50,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:09:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:09:50,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439832412] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-12 00:09:50,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:09:50,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 11 [2023-11-12 00:09:50,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028916282] [2023-11-12 00:09:50,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:09:50,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:09:50,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:09:50,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:09:50,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:09:50,452 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:09:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:09:50,537 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2023-11-12 00:09:50,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:09:50,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 25 [2023-11-12 00:09:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:09:50,538 INFO L225 Difference]: With dead ends: 28 [2023-11-12 00:09:50,538 INFO L226 Difference]: Without dead ends: 22 [2023-11-12 00:09:50,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-12 00:09:50,539 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:09:50,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 24 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:09:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-12 00:09:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-12 00:09:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:09:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-11-12 00:09:50,553 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 25 [2023-11-12 00:09:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:09:50,553 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-11-12 00:09:50,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:09:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-11-12 00:09:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 00:09:50,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:09:50,555 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:09:50,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03d0a2be-d4d2-4255-883c-81aed399e60c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0