./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ --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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:47:41,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:47:41,409 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 04:47:41,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:47:41,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:47:41,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:47:41,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:47:41,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:47:41,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:47:41,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:47:41,443 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:47:41,443 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:47:41,444 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:47:41,445 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:47:41,445 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:47:41,446 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:47:41,447 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:47:41,447 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:47:41,448 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:47:41,449 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:47:41,449 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:47:41,450 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:47:41,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:47:41,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:47:41,452 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:47:41,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:47:41,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:47:41,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:47:41,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:47:41,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:47:41,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:47:41,455 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:47:41,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:47:41,456 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:47:41,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:47:41,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:47:41,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:47:41,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:47:41,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:47:41,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:47:41,460 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:47:41,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:47:41,461 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:47:41,461 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:47:41,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:47:41,462 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_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/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_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2023-11-19 04:47:41,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:47:41,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:47:41,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:47:41,824 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:47:41,825 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:47:41,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2023-11-19 04:47:44,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:47:45,261 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:47:45,262 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2023-11-19 04:47:45,285 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/data/feeec48ad/46b1157210924755bb0a55879b7f4574/FLAG0e3640eab [2023-11-19 04:47:45,305 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/data/feeec48ad/46b1157210924755bb0a55879b7f4574 [2023-11-19 04:47:45,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:47:45,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:47:45,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:47:45,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:47:45,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:47:45,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:47:45" (1/1) ... [2023-11-19 04:47:45,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49fc4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45, skipping insertion in model container [2023-11-19 04:47:45,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:47:45" (1/1) ... [2023-11-19 04:47:45,393 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:47:45,786 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_b7949668-a222-4fa2-88df-27288ac9d4a9/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2023-11-19 04:47:45,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:47:45,811 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:47:45,880 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_b7949668-a222-4fa2-88df-27288ac9d4a9/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2023-11-19 04:47:45,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:47:45,916 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:47:45,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45 WrapperNode [2023-11-19 04:47:45,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:47:45,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:47:45,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:47:45,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:47:45,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45" (1/1) ... [2023-11-19 04:47:45,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45" (1/1) ... [2023-11-19 04:47:45,978 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2023-11-19 04:47:45,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:47:45,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:47:45,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:47:45,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:47:45,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45" (1/1) ... [2023-11-19 04:47:45,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45" (1/1) ... [2023-11-19 04:47:46,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45" (1/1) ... [2023-11-19 04:47:46,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45" (1/1) ... [2023-11-19 04:47:46,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45" (1/1) ... [2023-11-19 04:47:46,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45" (1/1) ... [2023-11-19 04:47:46,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45" (1/1) ... [2023-11-19 04:47:46,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45" (1/1) ... [2023-11-19 04:47:46,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:47:46,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:47:46,045 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:47:46,045 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:47:46,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45" (1/1) ... [2023-11-19 04:47:46,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:47:46,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:47:46,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:47:46,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:47:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:47:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:47:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 04:47:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:47:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 04:47:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 04:47:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:47:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:47:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:47:46,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:47:46,357 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:47:46,360 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:47:46,690 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:47:46,772 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:47:46,775 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-19 04:47:46,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:47:46 BoogieIcfgContainer [2023-11-19 04:47:46,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:47:46,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:47:46,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:47:46,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:47:46,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:47:45" (1/3) ... [2023-11-19 04:47:46,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e2f8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:47:46, skipping insertion in model container [2023-11-19 04:47:46,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:45" (2/3) ... [2023-11-19 04:47:46,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e2f8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:47:46, skipping insertion in model container [2023-11-19 04:47:46,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:47:46" (3/3) ... [2023-11-19 04:47:46,795 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2023-11-19 04:47:46,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:47:46,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 04:47:46,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:47:46,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;@421bcd50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:47:46,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 04:47:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 04:47:46,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:46,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:46,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:47:46,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:46,914 INFO L85 PathProgramCache]: Analyzing trace with hash 188652621, now seen corresponding path program 1 times [2023-11-19 04:47:46,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:46,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876876296] [2023-11-19 04:47:46,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:46,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:47,263 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-19 04:47:47,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:47,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876876296] [2023-11-19 04:47:47,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876876296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:47,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:47,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:47:47,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990128125] [2023-11-19 04:47:47,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:47,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:47:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:47,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:47:47,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:47:47,306 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:47,363 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2023-11-19 04:47:47,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:47:47,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-19 04:47:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:47,374 INFO L225 Difference]: With dead ends: 27 [2023-11-19 04:47:47,374 INFO L226 Difference]: Without dead ends: 12 [2023-11-19 04:47:47,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:47:47,381 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:47,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 16 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:47:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-19 04:47:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-11-19 04:47:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:47,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2023-11-19 04:47:47,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2023-11-19 04:47:47,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:47,416 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2023-11-19 04:47:47,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2023-11-19 04:47:47,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 04:47:47,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:47,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:47,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:47:47,418 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:47:47,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1236248315, now seen corresponding path program 1 times [2023-11-19 04:47:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:47,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547516406] [2023-11-19 04:47:47,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:47,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:47:47,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:47,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547516406] [2023-11-19 04:47:47,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547516406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:47,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:47,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:47:47,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850223212] [2023-11-19 04:47:47,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:47,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:47:47,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:47,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:47:47,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:47,587 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:47,650 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2023-11-19 04:47:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:47:47,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 04:47:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:47,652 INFO L225 Difference]: With dead ends: 23 [2023-11-19 04:47:47,653 INFO L226 Difference]: Without dead ends: 18 [2023-11-19 04:47:47,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:47:47,656 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:47,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:47:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-19 04:47:47,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2023-11-19 04:47:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2023-11-19 04:47:47,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2023-11-19 04:47:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:47,666 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-19 04:47:47,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2023-11-19 04:47:47,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:47:47,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:47,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:47,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:47:47,668 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:47:47,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash -660348294, now seen corresponding path program 1 times [2023-11-19 04:47:47,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:47,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219067669] [2023-11-19 04:47:47,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:47,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:47:47,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:47,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219067669] [2023-11-19 04:47:47,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219067669] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:47:47,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110824914] [2023-11-19 04:47:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:47,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:47,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:47:47,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:47:47,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:47:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:48,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:47:48,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:47:48,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:47:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:47:48,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110824914] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:47:48,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1679295207] [2023-11-19 04:47:48,127 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-19 04:47:48,140 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:47:48,150 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:47:48,157 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:47:48,158 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:47:50,096 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:47:50,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1679295207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:50,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:47:50,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 3, 3] total 8 [2023-11-19 04:47:50,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429836197] [2023-11-19 04:47:50,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:50,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:47:50,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:47:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:47:50,475 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:50,599 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2023-11-19 04:47:50,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:47:50,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-19 04:47:50,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:50,602 INFO L225 Difference]: With dead ends: 21 [2023-11-19 04:47:50,602 INFO L226 Difference]: Without dead ends: 14 [2023-11-19 04:47:50,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:47:50,608 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:50,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-19 04:47:50,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2023-11-19 04:47:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:50,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2023-11-19 04:47:50,617 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2023-11-19 04:47:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:50,618 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2023-11-19 04:47:50,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2023-11-19 04:47:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:47:50,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:50,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:50,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:47:50,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:50,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:47:50,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash 384828029, now seen corresponding path program 1 times [2023-11-19 04:47:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:50,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000080768] [2023-11-19 04:47:50,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:50,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 04:47:50,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000080768] [2023-11-19 04:47:50,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000080768] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:47:50,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637452702] [2023-11-19 04:47:50,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:50,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:47:50,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:47:50,984 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:47:50,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 04:47:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:51,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:47:51,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 04:47:51,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:47:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 04:47:51,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637452702] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:47:51,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1346616809] [2023-11-19 04:47:51,167 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-19 04:47:51,168 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:47:51,169 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:47:51,169 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:47:51,169 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:47:53,671 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:48:00,559 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '333#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~expected~0#1| 1) (exists ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int) (|v_#memory_int_69| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_59| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.base_30| Int) (|v_#memory_$Pointer$.base_59| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_69| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_int_69| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|)))) (<= 1 (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_59| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_$Pointer$.offset_59| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|)))))) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| 1)) (= |ULTIMATE.start_main_~len~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2023-11-19 04:48:00,560 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:48:00,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:48:00,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2023-11-19 04:48:00,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988067033] [2023-11-19 04:48:00,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:48:00,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:48:00,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:00,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:48:00,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=168, Unknown=3, NotChecked=0, Total=210 [2023-11-19 04:48:00,563 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:00,702 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2023-11-19 04:48:00,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:48:00,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 04:48:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:00,705 INFO L225 Difference]: With dead ends: 32 [2023-11-19 04:48:00,705 INFO L226 Difference]: Without dead ends: 23 [2023-11-19 04:48:00,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=60, Invalid=279, Unknown=3, NotChecked=0, Total=342 [2023-11-19 04:48:00,706 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:00,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 16 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:48:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-19 04:48:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2023-11-19 04:48:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-11-19 04:48:00,717 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2023-11-19 04:48:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:00,717 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-11-19 04:48:00,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:00,718 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-11-19 04:48:00,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:48:00,720 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:00,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:00,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 04:48:00,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:00,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:48:00,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:00,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1904764146, now seen corresponding path program 2 times [2023-11-19 04:48:00,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:00,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355475416] [2023-11-19 04:48:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 04:48:01,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:01,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355475416] [2023-11-19 04:48:01,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355475416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:48:01,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:48:01,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:48:01,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120582594] [2023-11-19 04:48:01,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:48:01,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:48:01,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:01,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:48:01,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:48:01,143 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:01,207 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2023-11-19 04:48:01,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:48:01,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-19 04:48:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:01,211 INFO L225 Difference]: With dead ends: 28 [2023-11-19 04:48:01,213 INFO L226 Difference]: Without dead ends: 23 [2023-11-19 04:48:01,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:48:01,214 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:01,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:48:01,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-19 04:48:01,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2023-11-19 04:48:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-11-19 04:48:01,228 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2023-11-19 04:48:01,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:01,228 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-11-19 04:48:01,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-11-19 04:48:01,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 04:48:01,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:01,230 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:01,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:48:01,231 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:48:01,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:01,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1080201052, now seen corresponding path program 1 times [2023-11-19 04:48:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:01,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224961761] [2023-11-19 04:48:01,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:01,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:48:03,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:03,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224961761] [2023-11-19 04:48:03,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224961761] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:48:03,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302047954] [2023-11-19 04:48:03,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:03,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:03,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:48:03,035 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:48:03,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 04:48:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:03,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 90 conjunts are in the unsatisfiable core [2023-11-19 04:48:03,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:48:03,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 04:48:03,298 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:48:03,298 INFO L378 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 11 treesize of output 11 [2023-11-19 04:48:03,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-19 04:48:03,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 04:48:03,564 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-19 04:48:03,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2023-11-19 04:48:03,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-11-19 04:48:03,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2023-11-19 04:48:03,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:48:03,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2023-11-19 04:48:03,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-19 04:48:03,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:48:03,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2023-11-19 04:48:03,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-11-19 04:48:03,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 04:48:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:48:03,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:48:04,118 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_266 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_266)) (not (= v_ArrVal_268 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_268 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_267) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_268) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1)))) is different from false [2023-11-19 04:48:04,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:48:04,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2023-11-19 04:48:04,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:48:04,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 101 [2023-11-19 04:48:04,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-11-19 04:48:05,160 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (forall ((v_ArrVal_263 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_263) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_1) .cse1))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (forall ((v_ArrVal_265 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_265) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_2) .cse1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (forall ((v_ArrVal_263 (Array Int Int)) (v_DerPreprocessor_1 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_263) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_DerPreprocessor_1) .cse1))))))))) is different from false [2023-11-19 04:48:05,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:48:05,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-19 04:48:05,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-11-19 04:48:05,193 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:48:05,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 04:48:05,205 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:48:05,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-19 04:48:05,216 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-19 04:48:05,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2023-11-19 04:48:05,219 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:48:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-19 04:48:05,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302047954] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:48:05,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [534849525] [2023-11-19 04:48:05,347 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-19 04:48:05,347 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:48:05,347 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:48:05,347 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:48:05,348 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:48:06,058 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:48:09,652 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '652#(and (exists ((|v_#memory_int_88| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.base_43| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_update_at_~head#1.base_43| (store (select |v_#memory_$Pointer$.offset_79| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|)))) (= |#memory_int| (store |v_#memory_int_88| |v_ULTIMATE.start_sll_update_at_~head#1.base_43| (store (select |v_#memory_int_88| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|)))) (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) 3) (= (store |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_update_at_~head#1.base_43| (store (select |v_#memory_$Pointer$.base_79| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_43|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) |#memory_$Pointer$.base|))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 1) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= 3 |ULTIMATE.start_sll_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) |ULTIMATE.start_sll_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2023-11-19 04:48:09,653 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:48:09,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:48:09,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 42 [2023-11-19 04:48:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777816661] [2023-11-19 04:48:09,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:48:09,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-19 04:48:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:09,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-19 04:48:09,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2055, Unknown=46, NotChecked=186, Total=2450 [2023-11-19 04:48:09,657 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:11,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:11,009 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2023-11-19 04:48:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 04:48:11,012 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-19 04:48:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:11,013 INFO L225 Difference]: With dead ends: 40 [2023-11-19 04:48:11,013 INFO L226 Difference]: Without dead ends: 38 [2023-11-19 04:48:11,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=327, Invalid=3295, Unknown=46, NotChecked=238, Total=3906 [2023-11-19 04:48:11,016 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 119 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:11,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 61 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 394 Invalid, 0 Unknown, 89 Unchecked, 0.5s Time] [2023-11-19 04:48:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-19 04:48:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2023-11-19 04:48:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-11-19 04:48:11,027 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2023-11-19 04:48:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:11,027 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-11-19 04:48:11,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-11-19 04:48:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 04:48:11,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:11,029 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:11,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 04:48:11,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:11,245 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:48:11,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:11,245 INFO L85 PathProgramCache]: Analyzing trace with hash -875158322, now seen corresponding path program 2 times [2023-11-19 04:48:11,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:11,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143459926] [2023-11-19 04:48:11,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:11,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 04:48:11,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:11,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143459926] [2023-11-19 04:48:11,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143459926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:48:11,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:48:11,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:48:11,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433617323] [2023-11-19 04:48:11,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:48:11,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:48:11,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:11,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:48:11,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:48:11,376 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:11,440 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2023-11-19 04:48:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:48:11,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-19 04:48:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:11,442 INFO L225 Difference]: With dead ends: 33 [2023-11-19 04:48:11,442 INFO L226 Difference]: Without dead ends: 28 [2023-11-19 04:48:11,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:48:11,444 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:11,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:48:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-19 04:48:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-19 04:48:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-11-19 04:48:11,480 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2023-11-19 04:48:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:11,480 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-11-19 04:48:11,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:11,481 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-11-19 04:48:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 04:48:11,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:11,482 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:11,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 04:48:11,483 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:48:11,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1455356257, now seen corresponding path program 3 times [2023-11-19 04:48:11,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:11,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089021038] [2023-11-19 04:48:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:11,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 04:48:11,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089021038] [2023-11-19 04:48:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089021038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:48:11,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:48:11,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:48:11,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893747179] [2023-11-19 04:48:11,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:48:11,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:48:11,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:11,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:48:11,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:48:11,624 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:11,689 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-11-19 04:48:11,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:48:11,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-19 04:48:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:11,690 INFO L225 Difference]: With dead ends: 42 [2023-11-19 04:48:11,691 INFO L226 Difference]: Without dead ends: 32 [2023-11-19 04:48:11,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:48:11,692 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:11,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 19 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:48:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-19 04:48:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-11-19 04:48:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-19 04:48:11,702 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 18 [2023-11-19 04:48:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:11,703 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-19 04:48:11,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-19 04:48:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 04:48:11,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:11,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:11,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 04:48:11,704 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:48:11,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash -461139389, now seen corresponding path program 4 times [2023-11-19 04:48:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:11,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724166966] [2023-11-19 04:48:11,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:11,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 04:48:11,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:11,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724166966] [2023-11-19 04:48:11,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724166966] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:48:11,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070540943] [2023-11-19 04:48:11,818 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-19 04:48:11,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:11,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:48:11,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:48:11,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 04:48:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:11,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 04:48:11,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:48:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 04:48:11,996 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:48:11,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070540943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:48:11,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 04:48:11,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-11-19 04:48:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254754973] [2023-11-19 04:48:11,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:48:11,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:48:11,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:11,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:48:11,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:48:11,999 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:12,057 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-11-19 04:48:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:48:12,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-19 04:48:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:12,058 INFO L225 Difference]: With dead ends: 34 [2023-11-19 04:48:12,059 INFO L226 Difference]: Without dead ends: 22 [2023-11-19 04:48:12,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-19 04:48:12,060 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:12,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 9 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:48:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-19 04:48:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-19 04:48:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-19 04:48:12,068 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2023-11-19 04:48:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:12,069 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-19 04:48:12,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-19 04:48:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:48:12,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:12,070 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:12,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 04:48:12,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:12,283 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:48:12,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1893796027, now seen corresponding path program 1 times [2023-11-19 04:48:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:12,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751721195] [2023-11-19 04:48:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 04:48:12,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751721195] [2023-11-19 04:48:12,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751721195] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:48:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279299624] [2023-11-19 04:48:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:12,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:12,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:48:12,702 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:48:12,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 04:48:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:12,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-19 04:48:12,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:48:12,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-19 04:48:13,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-11-19 04:48:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 04:48:13,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:48:13,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-11-19 04:48:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 04:48:13,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279299624] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:48:13,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2021887395] [2023-11-19 04:48:13,150 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-19 04:48:13,151 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:48:13,151 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:48:13,151 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:48:13,151 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:48:19,957 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:48:20,631 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1337#(and (exists ((|v_ULTIMATE.start_main_#t~ret15#1_31| Int)) (and (not (= |v_ULTIMATE.start_main_#t~ret15#1_31| |ULTIMATE.start_main_~expected~0#1|)) (or (and (= |v_ULTIMATE.start_main_#t~ret15#1_31| |ULTIMATE.start_sll_get_data_at_#res#1|) (exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_31| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.base_31| Int)) (= |ULTIMATE.start_sll_get_data_at_#res#1| (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_31|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_31|))) (exists ((|v_ULTIMATE.start_sll_get_data_at_~index#1_26| Int) (|v_ULTIMATE.start_sll_get_data_at_#in~index#1_19| Int)) (and (<= 1 |ULTIMATE.start_main_~expected~0#1|) (= |v_ULTIMATE.start_sll_get_data_at_~index#1_26| 0) (<= 1 |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 |v_ULTIMATE.start_sll_get_data_at_#in~index#1_19|)))) (and (= |v_ULTIMATE.start_main_#t~ret15#1_31| |ULTIMATE.start_sll_get_data_at_#res#1|) (exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_35| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.base_35| Int)) (= (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_35|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_35|) |ULTIMATE.start_sll_get_data_at_#res#1|)))))) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2023-11-19 04:48:20,632 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:48:20,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:48:20,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2023-11-19 04:48:20,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639393533] [2023-11-19 04:48:20,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:48:20,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-19 04:48:20,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:20,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-19 04:48:20,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2023-11-19 04:48:20,634 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:21,042 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-11-19 04:48:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 04:48:21,043 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-19 04:48:21,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:21,043 INFO L225 Difference]: With dead ends: 27 [2023-11-19 04:48:21,043 INFO L226 Difference]: Without dead ends: 25 [2023-11-19 04:48:21,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2023-11-19 04:48:21,045 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 41 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:21,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 44 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:48:21,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-19 04:48:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2023-11-19 04:48:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-19 04:48:21,055 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2023-11-19 04:48:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:21,055 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-19 04:48:21,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:21,056 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-19 04:48:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 04:48:21,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:21,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:21,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 04:48:21,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-19 04:48:21,260 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:48:21,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:21,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1420212741, now seen corresponding path program 2 times [2023-11-19 04:48:21,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:21,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52761435] [2023-11-19 04:48:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:21,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-19 04:48:21,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:21,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52761435] [2023-11-19 04:48:21,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52761435] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:48:21,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852140588] [2023-11-19 04:48:21,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 04:48:21,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:21,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:48:21,377 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:48:21,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 04:48:21,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-19 04:48:21,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:48:21,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 04:48:21,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:48:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-19 04:48:21,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:48:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-19 04:48:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852140588] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:48:21,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1791932862] [2023-11-19 04:48:21,599 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-19 04:48:21,599 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:48:21,599 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:48:21,599 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:48:21,600 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:48:24,265 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:48:25,031 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1569#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_#t~ret15#1_37| Int)) (and (not (= |v_ULTIMATE.start_main_#t~ret15#1_37| |ULTIMATE.start_main_~expected~0#1|)) (or (and (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_64| Int) (|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.base_64| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|) 3) (= |#memory_int| (store |v_#memory_int_125| |v_ULTIMATE.start_sll_update_at_~head#1.base_64| (store (select |v_#memory_int_125| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|)))) (= (store |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64| (store (select |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|))) |#memory_$Pointer$.base|))) (= |ULTIMATE.start_main_~i~0#1| 1) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= |v_ULTIMATE.start_main_#t~ret15#1_37| |ULTIMATE.start_sll_get_data_at_#res#1|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) |ULTIMATE.start_sll_get_data_at_#res#1|)) (and (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_64| Int) (|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.base_64| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|) 3) (= |#memory_int| (store |v_#memory_int_125| |v_ULTIMATE.start_sll_update_at_~head#1.base_64| (store (select |v_#memory_int_125| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|)))) (= (store |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64| (store (select |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_64|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_64|))) |#memory_$Pointer$.base|))) (= |ULTIMATE.start_main_~i~0#1| 0) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3) (= |v_ULTIMATE.start_main_#t~ret15#1_37| |ULTIMATE.start_sll_get_data_at_#res#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) |ULTIMATE.start_sll_get_data_at_#res#1|))))) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2023-11-19 04:48:25,032 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:48:25,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:48:25,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-11-19 04:48:25,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048082361] [2023-11-19 04:48:25,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:48:25,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:48:25,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:25,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:48:25,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-11-19 04:48:25,033 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:25,165 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-11-19 04:48:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:48:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-19 04:48:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:25,166 INFO L225 Difference]: With dead ends: 26 [2023-11-19 04:48:25,166 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 04:48:25,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-11-19 04:48:25,168 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:25,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 9 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:48:25,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 04:48:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 04:48:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 04:48:25,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2023-11-19 04:48:25,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:25,169 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 04:48:25,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:48:25,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 04:48:25,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 04:48:25,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 04:48:25,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-19 04:48:25,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:25,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 04:48:26,051 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-11-19 04:48:26,051 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select .cse1 0) 2) (= (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3) .cse2 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (and (= (select .cse1 |ULTIMATE.start_main_~s~0#1.offset|) 2) (<= |ULTIMATE.start_main_~i~0#1| 0) .cse2))) [2023-11-19 04:48:26,051 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 613 632) no Hoare annotation was computed. [2023-11-19 04:48:26,051 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse5 (= 3 |ULTIMATE.start_sll_update_at_~data#1|)) (.cse6 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4)) (.cse1 (= |ULTIMATE.start_sll_update_at_~head#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base|) 4)) 3) (= 2 |ULTIMATE.start_sll_update_at_~data#1|) .cse1 .cse2 (= |ULTIMATE.start_sll_update_at_~index#1| 0) .cse3 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse0)) .cse4) (and (= |ULTIMATE.start_sll_update_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (not .cse3) .cse5 .cse6 (<= |ULTIMATE.start_sll_update_at_~index#1| 0) (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse2 .cse4) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_update_at_~index#1| 1) .cse5 .cse6 (= |ULTIMATE.start_node_create_#res#1.offset| 0) (not (= .cse0 |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_sll_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= 3 |ULTIMATE.start_main_~new_data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0) .cse1 .cse2 (= |ULTIMATE.start_sll_update_at_#in~index#1| 1) .cse3 (= 3 |ULTIMATE.start_sll_update_at_#in~data#1|) .cse4))) [2023-11-19 04:48:26,051 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2023-11-19 04:48:26,052 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 04:48:26,052 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse10 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse11))) (.cse2 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse4 (= (select .cse10 0) 2)) (.cse5 (= (select (select |#memory_int| .cse11) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3)) (.cse7 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|))) (or (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) 4))) (and .cse0 (not (= |ULTIMATE.start_sll_get_data_at_~head#1.base| .cse1)) .cse2 (= (select (select |#memory_int| .cse1) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_~head#1.base|) 4)) 3) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| 0) (= |ULTIMATE.start_sll_get_data_at_~index#1| 1) .cse7)) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse5 (= .cse9 3) .cse6 .cse7) (and .cse8 (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select .cse10 |ULTIMATE.start_main_~s~0#1.offset|) 2) (* |ULTIMATE.start_main_~len~0#1| 2)) (= (+ (* (div (* (- 1) .cse9) 2) 2) |ULTIMATE.start_main_~expected~0#1|) 0) .cse6 (= (mod .cse9 2) 0))))) [2023-11-19 04:48:26,052 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-11-19 04:48:26,052 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-11-19 04:48:26,052 INFO L895 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse4))) (.cse3 (= (select (select |#memory_int| .cse4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) .cse1 .cse2) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse3 .cse1 .cse2) (and .cse0 (<= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2) .cse3 .cse1 .cse2)))) [2023-11-19 04:48:26,053 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_node_create_#res#1.offset| 0)) (.cse4 (= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse5 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse6 (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse9 (= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse10 (<= |ULTIMATE.start_sll_create_~len#1| 2))) (or (and .cse0 .cse1 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9) (and .cse2 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse4 .cse5 .cse8 .cse9)) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse10))) [2023-11-19 04:48:26,053 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2023-11-19 04:48:26,053 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 04:48:26,053 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 613 632) no Hoare annotation was computed. [2023-11-19 04:48:26,056 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1] [2023-11-19 04:48:26,058 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 04:48:26,075 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-19 04:48:26,076 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-19 04:48:26,076 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-19 04:48:26,076 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][~s~0!offset] could not be translated [2023-11-19 04:48:26,078 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-19 04:48:26,078 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,079 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,079 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-19 04:48:26,079 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,080 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-19 04:48:26,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-19 04:48:26,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-19 04:48:26,083 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-19 04:48:26,083 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-19 04:48:26,083 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-19 04:48:26,083 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-19 04:48:26,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 04:48:26,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-19 04:48:26,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-19 04:48:26,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-19 04:48:26,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-19 04:48:26,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-19 04:48:26,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-19 04:48:26,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-19 04:48:26,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-19 04:48:26,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 04:48:26,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-19 04:48:26,089 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-19 04:48:26,089 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-19 04:48:26,089 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-11-19 04:48:26,089 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-11-19 04:48:26,089 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset] could not be translated [2023-11-19 04:48:26,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-19 04:48:26,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-19 04:48:26,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][~s~0!offset] could not be translated [2023-11-19 04:48:26,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-19 04:48:26,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset] could not be translated [2023-11-19 04:48:26,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-19 04:48:26,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-19 04:48:26,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset] could not be translated [2023-11-19 04:48:26,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-19 04:48:26,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated [2023-11-19 04:48:26,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-19 04:48:26,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 04:48:26,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-19 04:48:26,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated [2023-11-19 04:48:26,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 04:48:26,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-19 04:48:26,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-11-19 04:48:26,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-19 04:48:26,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 04:48:26,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-19 04:48:26,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,098 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-11-19 04:48:26,098 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 04:48:26,098 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,098 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 04:48:26,099 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,099 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-11-19 04:48:26,099 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,099 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,100 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-19 04:48:26,100 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 04:48:26,100 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 04:48:26,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:48:26 BoogieIcfgContainer [2023-11-19 04:48:26,101 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 04:48:26,101 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 04:48:26,101 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 04:48:26,102 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 04:48:26,102 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:47:46" (3/4) ... [2023-11-19 04:48:26,104 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 04:48:26,113 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-11-19 04:48:26,113 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-19 04:48:26,114 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 04:48:26,114 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 04:48:26,142 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2)) || (((2 == len) && (((((2 == \old(len)) && (data == 1)) && (data == 1)) && (\old(data) == 1)) || ((((2 == \old(len)) && (data == 1)) && (data == 1)) && (\old(data) == 1)))) && (len == 2))) || ((((((2 == \old(len)) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2))) [2023-11-19 04:48:26,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 == data) && (index == 0)) || ((3 == data) && (index <= 0))) || (((((index == 1) && (3 == data)) && (data == 1)) && (\old(index) == 1)) && (3 == \old(data)))) [2023-11-19 04:48:26,161 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2)) || (((2 == len) && (((((2 == \old(len)) && (data == 1)) && (data == 1)) && (\old(data) == 1)) || ((((2 == \old(len)) && (data == 1)) && (data == 1)) && (\old(data) == 1)))) && (len == 2))) || ((((((2 == \old(len)) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2))) [2023-11-19 04:48:26,164 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 == data) && (index == 0)) || ((3 == data) && (index <= 0))) || (((((index == 1) && (3 == data)) && (data == 1)) && (\old(index) == 1)) && (3 == \old(data)))) [2023-11-19 04:48:26,214 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/witness.graphml [2023-11-19 04:48:26,214 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/witness.yml [2023-11-19 04:48:26,215 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 04:48:26,215 INFO L158 Benchmark]: Toolchain (without parser) took 40900.92ms. Allocated memory was 132.1MB in the beginning and 371.2MB in the end (delta: 239.1MB). Free memory was 84.9MB in the beginning and 258.7MB in the end (delta: -173.8MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2023-11-19 04:48:26,216 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 132.1MB. Free memory was 101.8MB in the beginning and 101.8MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:48:26,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.48ms. Allocated memory is still 132.1MB. Free memory was 84.4MB in the beginning and 67.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-19 04:48:26,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.95ms. Allocated memory is still 132.1MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:48:26,217 INFO L158 Benchmark]: Boogie Preprocessor took 64.23ms. Allocated memory is still 132.1MB. Free memory was 64.8MB in the beginning and 63.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:48:26,217 INFO L158 Benchmark]: RCFGBuilder took 736.13ms. Allocated memory was 132.1MB in the beginning and 176.2MB in the end (delta: 44.0MB). Free memory was 63.0MB in the beginning and 134.2MB in the end (delta: -71.3MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2023-11-19 04:48:26,218 INFO L158 Benchmark]: TraceAbstraction took 39316.53ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 133.2MB in the beginning and 263.9MB in the end (delta: -130.7MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2023-11-19 04:48:26,218 INFO L158 Benchmark]: Witness Printer took 113.44ms. Allocated memory is still 371.2MB. Free memory was 263.9MB in the beginning and 258.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 04:48:26,220 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 132.1MB. Free memory was 101.8MB in the beginning and 101.8MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 599.48ms. Allocated memory is still 132.1MB. Free memory was 84.4MB in the beginning and 67.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.95ms. Allocated memory is still 132.1MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.23ms. Allocated memory is still 132.1MB. Free memory was 64.8MB in the beginning and 63.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 736.13ms. Allocated memory was 132.1MB in the beginning and 176.2MB in the end (delta: 44.0MB). Free memory was 63.0MB in the beginning and 134.2MB in the end (delta: -71.3MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * TraceAbstraction took 39316.53ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 133.2MB in the beginning and 263.9MB in the end (delta: -130.7MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. * Witness Printer took 113.44ms. Allocated memory is still 371.2MB. Free memory was 263.9MB in the beginning and 258.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][~s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][~s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][4]][#memory_$Pointer$.offset[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 630]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.2s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 315 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 315 mSDsluCounter, 220 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 89 IncrementalHoareTripleChecker+Unchecked, 167 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 830 IncrementalHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 53 mSDtfsCounter, 830 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 183 SyntacticMatches, 7 SemanticMatches, 163 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=7, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 36 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 20 NumberOfFragments, 610 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1189 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 173 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 266 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 325 ConstructedInterpolants, 6 QuantifiedInterpolants, 2075 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1414 ConjunctsInSsa, 161 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 148/213 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 2.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 6, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 14, TOOLS_POST_TIME: 0.9s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 13, TOOLS_QUANTIFIERELIM_TIME: 0.9s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 30, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 4, DOMAIN_ISSUBSETEQ_TIME: 0.8s, DOMAIN_ISBOTTOM_APPLICATIONS: 6, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 1.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 4, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 120, DAG_COMPRESSION_RETAINED_NODES: 32, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: (((i == 1) && (len == 2)) || ((i <= 0) && (len == 2))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: (((((((((1 <= len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2)) || (((2 == len) && (((((2 == \old(len)) && (data == 1)) && (data == 1)) && (\old(data) == 1)) || ((((2 == \old(len)) && (data == 1)) && (data == 1)) && (\old(data) == 1)))) && (len == 2))) || ((((((2 == \old(len)) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2))) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((i == 1) && (data == 1)) && (len == 2)) || ((i == 0) && (len == 2))) || ((i <= 0) && (len == 2))) - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: (((index == 1) || (index <= 0)) || (index <= 0)) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: ((((2 == data) && (index == 0)) || ((3 == data) && (index <= 0))) || (((((index == 1) && (3 == data)) && (data == 1)) && (\old(index) == 1)) && (3 == \old(data)))) RESULT: Ultimate proved your program to be correct! [2023-11-19 04:48:26,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7949668-a222-4fa2-88df-27288ac9d4a9/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE