./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:47:46,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:47:46,303 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:47:46,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:47:46,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:47:46,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:47:46,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:47:46,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:47:46,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:47:46,334 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:47:46,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:47:46,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:47:46,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:47:46,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:47:46,337 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:47:46,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:47:46,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:47:46,339 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:47:46,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:47:46,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:47:46,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:47:46,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:47:46,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:47:46,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:47:46,342 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:47:46,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:47:46,343 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:47:46,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:47:46,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:47:46,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:47:46,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:47:46,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:47:46,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:47:46,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:47:46,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:47:46,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:47:46,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:47:46,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:47:46,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:47:46,347 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:47:46,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:47:46,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:47:46,347 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/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_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2023-11-29 04:47:46,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:47:46,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:47:46,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:47:46,581 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:47:46,581 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:47:46,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-11-29 04:47:49,361 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:47:49,573 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:47:49,574 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-11-29 04:47:49,586 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/data/4692d1fd2/67fb615cf43d488593edc21588fe65f6/FLAG5516df4a2 [2023-11-29 04:47:49,601 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/data/4692d1fd2/67fb615cf43d488593edc21588fe65f6 [2023-11-29 04:47:49,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:47:49,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:47:49,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:47:49,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:47:49,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:47:49,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:47:49" (1/1) ... [2023-11-29 04:47:49,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d789ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:49, skipping insertion in model container [2023-11-29 04:47:49,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:47:49" (1/1) ... [2023-11-29 04:47:49,662 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:47:49,935 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_a8ca670e-18b7-4295-b41e-b103fd6fd921/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2023-11-29 04:47:49,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:47:49,950 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:47:49,986 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_a8ca670e-18b7-4295-b41e-b103fd6fd921/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2023-11-29 04:47:49,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:47:50,018 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:47:50,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50 WrapperNode [2023-11-29 04:47:50,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:47:50,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:47:50,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:47:50,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:47:50,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50" (1/1) ... [2023-11-29 04:47:50,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50" (1/1) ... [2023-11-29 04:47:50,063 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 105 [2023-11-29 04:47:50,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:47:50,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:47:50,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:47:50,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:47:50,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50" (1/1) ... [2023-11-29 04:47:50,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50" (1/1) ... [2023-11-29 04:47:50,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50" (1/1) ... [2023-11-29 04:47:50,097 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2023-11-29 04:47:50,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50" (1/1) ... [2023-11-29 04:47:50,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50" (1/1) ... [2023-11-29 04:47:50,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50" (1/1) ... [2023-11-29 04:47:50,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50" (1/1) ... [2023-11-29 04:47:50,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50" (1/1) ... [2023-11-29 04:47:50,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50" (1/1) ... [2023-11-29 04:47:50,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:47:50,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:47:50,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:47:50,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:47:50,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50" (1/1) ... [2023-11-29 04:47:50,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:47:50,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:47:50,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:47:50,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:47:50,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:47:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:47:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:47:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:47:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:47:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:47:50,187 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 04:47:50,187 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 04:47:50,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:47:50,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:47:50,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:47:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:47:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:47:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:47:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:47:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:47:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:47:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:47:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 04:47:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 04:47:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 04:47:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:47:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:47:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:47:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:47:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:47:50,329 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:47:50,330 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:47:50,485 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:47:50,524 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:47:50,524 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 04:47:50,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:47:50 BoogieIcfgContainer [2023-11-29 04:47:50,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:47:50,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:47:50,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:47:50,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:47:50,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:47:49" (1/3) ... [2023-11-29 04:47:50,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@701e0bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:47:50, skipping insertion in model container [2023-11-29 04:47:50,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:47:50" (2/3) ... [2023-11-29 04:47:50,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@701e0bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:47:50, skipping insertion in model container [2023-11-29 04:47:50,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:47:50" (3/3) ... [2023-11-29 04:47:50,533 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2023-11-29 04:47:50,549 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:47:50,549 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:47:50,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:47:50,596 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=PETRI_NET, 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;@5627269d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:47:50,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:47:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:47:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:47:50,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:50,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:50,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:47:50,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2095146488, now seen corresponding path program 1 times [2023-11-29 04:47:50,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:47:50,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010189861] [2023-11-29 04:47:50,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:50,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:47:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:50,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 04:47:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:50,840 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-29 04:47:50,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:47:50,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010189861] [2023-11-29 04:47:50,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010189861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:47:50,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:47:50,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:47:50,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341032620] [2023-11-29 04:47:50,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:47:50,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:47:50,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:47:50,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:47:50,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:47:50,899 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:47:50,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:50,950 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2023-11-29 04:47:50,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:47:50,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-29 04:47:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:50,959 INFO L225 Difference]: With dead ends: 36 [2023-11-29 04:47:50,959 INFO L226 Difference]: Without dead ends: 15 [2023-11-29 04:47:50,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-29 04:47:50,965 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:50,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:47:50,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-29 04:47:50,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-29 04:47:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:47:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-11-29 04:47:50,997 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2023-11-29 04:47:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:50,997 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-11-29 04:47:50,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:47:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-11-29 04:47:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:47:50,999 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:50,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:50,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:47:50,999 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:47:51,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:51,000 INFO L85 PathProgramCache]: Analyzing trace with hash -523038448, now seen corresponding path program 1 times [2023-11-29 04:47:51,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:47:51,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898443321] [2023-11-29 04:47:51,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:51,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:47:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 04:47:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:51,155 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-29 04:47:51,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:47:51,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898443321] [2023-11-29 04:47:51,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898443321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:47:51,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:47:51,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:47:51,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325366869] [2023-11-29 04:47:51,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:47:51,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:47:51,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:47:51,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:47:51,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:47:51,159 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:47:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:51,198 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2023-11-29 04:47:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:47:51,198 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-29 04:47:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:51,199 INFO L225 Difference]: With dead ends: 29 [2023-11-29 04:47:51,199 INFO L226 Difference]: Without dead ends: 18 [2023-11-29 04:47:51,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:47:51,201 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:51,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:47:51,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-29 04:47:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-11-29 04:47:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:47:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-11-29 04:47:51,208 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2023-11-29 04:47:51,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:51,208 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-29 04:47:51,209 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:47:51,209 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-11-29 04:47:51,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 04:47:51,210 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:51,210 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:51,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:47:51,210 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:47:51,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:51,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1472129899, now seen corresponding path program 1 times [2023-11-29 04:47:51,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:47:51,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284729808] [2023-11-29 04:47:51,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:51,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:47:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:51,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:47:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:51,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 04:47:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:47:51,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:47:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284729808] [2023-11-29 04:47:51,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284729808] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:47:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386879742] [2023-11-29 04:47:51,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:51,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:47:51,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:47:51,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:47:51,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:47:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:51,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:47:51,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:47:51,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:51,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:47:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:47:51,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386879742] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:47:51,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:47:51,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-11-29 04:47:51,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338679839] [2023-11-29 04:47:51,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:47:51,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:47:51,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:47:51,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:47:51,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:47:51,615 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:47:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:51,664 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2023-11-29 04:47:51,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:47:51,664 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), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17 [2023-11-29 04:47:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:51,665 INFO L225 Difference]: With dead ends: 30 [2023-11-29 04:47:51,665 INFO L226 Difference]: Without dead ends: 19 [2023-11-29 04:47:51,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:47:51,667 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:51,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 37 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:47:51,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-29 04:47:51,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-29 04:47:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:47:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-11-29 04:47:51,672 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 17 [2023-11-29 04:47:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:51,673 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-11-29 04:47:51,673 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), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:47:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-11-29 04:47:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 04:47:51,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:51,674 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:51,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:47:51,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:47:51,875 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:47:51,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1900653178, now seen corresponding path program 2 times [2023-11-29 04:47:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:47:51,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753439315] [2023-11-29 04:47:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:51,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:47:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:52,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:47:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:52,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:47:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:52,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 04:47:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:47:52,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:47:52,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753439315] [2023-11-29 04:47:52,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753439315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:47:52,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:47:52,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:47:52,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421315736] [2023-11-29 04:47:52,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:47:52,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:47:52,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:47:52,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:47:52,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:47:52,622 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:47:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:52,744 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-11-29 04:47:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:47:52,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-11-29 04:47:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:52,745 INFO L225 Difference]: With dead ends: 26 [2023-11-29 04:47:52,746 INFO L226 Difference]: Without dead ends: 24 [2023-11-29 04:47:52,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:47:52,747 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:52,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:47:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-29 04:47:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2023-11-29 04:47:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:47:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-11-29 04:47:52,753 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 23 [2023-11-29 04:47:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:52,754 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-11-29 04:47:52,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:47:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-11-29 04:47:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 04:47:52,755 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:52,755 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:52,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:47:52,756 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:47:52,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1900654852, now seen corresponding path program 1 times [2023-11-29 04:47:52,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:47:52,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464074669] [2023-11-29 04:47:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:52,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:47:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:53,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:47:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:53,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:47:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:53,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 04:47:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:47:53,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:47:53,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464074669] [2023-11-29 04:47:53,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464074669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:47:53,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:47:53,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:47:53,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917163710] [2023-11-29 04:47:53,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:47:53,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:47:53,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:47:53,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:47:53,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:47:53,090 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:47:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:53,158 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2023-11-29 04:47:53,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:47:53,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-11-29 04:47:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:53,159 INFO L225 Difference]: With dead ends: 24 [2023-11-29 04:47:53,159 INFO L226 Difference]: Without dead ends: 21 [2023-11-29 04:47:53,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:47:53,161 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:53,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:47:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-29 04:47:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-29 04:47:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:47:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-29 04:47:53,167 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 23 [2023-11-29 04:47:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:53,167 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-29 04:47:53,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:47:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-29 04:47:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:47:53,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:53,169 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:53,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:47:53,169 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:47:53,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:53,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1166569407, now seen corresponding path program 1 times [2023-11-29 04:47:53,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:47:53,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177941837] [2023-11-29 04:47:53,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:53,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:47:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:47:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:54,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:47:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:54,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 04:47:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:47:54,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:47:54,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177941837] [2023-11-29 04:47:54,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177941837] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:47:54,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311862920] [2023-11-29 04:47:54,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:54,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:47:54,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:47:54,597 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:47:54,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:47:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:54,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-29 04:47:54,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:47:54,877 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-29 04:47:54,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:47:54,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:47:55,109 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 9 treesize of output 3 [2023-11-29 04:47:55,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 04:47:55,315 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:47:55,315 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 15 treesize of output 15 [2023-11-29 04:47:55,328 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 20 treesize of output 15 [2023-11-29 04:47:55,460 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 21 treesize of output 17 [2023-11-29 04:47:55,470 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 13 treesize of output 9 [2023-11-29 04:47:55,477 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 33 treesize of output 21 [2023-11-29 04:47:55,485 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 22 treesize of output 17 [2023-11-29 04:47:55,563 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 33 treesize of output 15 [2023-11-29 04:47:55,569 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 9 treesize of output 3 [2023-11-29 04:47:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:47:55,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:47:55,789 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 208 treesize of output 178 [2023-11-29 04:47:55,794 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 314 treesize of output 254 [2023-11-29 04:47:55,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse6 (select .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse1 (and (forall ((v_arrayElimCell_12 Int) (v_ArrVal_554 (Array Int Int)) (v_arrayElimCell_11 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554) v_arrayElimCell_11) v_arrayElimCell_12))) (forall ((v_arrayElimCell_12 Int) (v_ArrVal_554 (Array Int Int)) (v_arrayElimCell_11 Int)) (let ((.cse11 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554) v_arrayElimCell_11))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 v_arrayElimCell_12)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 .cse6))))))) (.cse3 (forall ((|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int)) (= |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse0 (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse2 (forall ((v_arrayElimCell_12 Int) (v_ArrVal_554 (Array Int Int)) (v_arrayElimCell_11 Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 .cse5) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 v_arrayElimCell_11) v_arrayElimCell_12))))))) (and (or .cse0 .cse1) (or .cse2 .cse3) (forall ((v_ArrVal_554 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse4 .cse5) .cse6)) (forall ((v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse7 (select .cse4 v_arrayElimCell_11))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 v_arrayElimCell_12)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse6)))))))) (or .cse1 .cse3) (or (forall ((|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int)) (not (= |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not .cse0) (forall ((v_ArrVal_554 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554) .cse5) .cse6)))) (or .cse0 .cse2))))) is different from false [2023-11-29 04:47:56,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311862920] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:47:56,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:47:56,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2023-11-29 04:47:56,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72942236] [2023-11-29 04:47:56,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:47:56,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 04:47:56,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:47:56,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 04:47:56,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=858, Unknown=1, NotChecked=58, Total=992 [2023-11-29 04:47:56,623 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 04:47:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:57,497 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-11-29 04:47:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:47:57,498 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2023-11-29 04:47:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:57,499 INFO L225 Difference]: With dead ends: 31 [2023-11-29 04:47:57,499 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 04:47:57,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=137, Invalid=1588, Unknown=1, NotChecked=80, Total=1806 [2023-11-29 04:47:57,501 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:57,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 157 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:47:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 04:47:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-11-29 04:47:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:47:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-29 04:47:57,508 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 25 [2023-11-29 04:47:57,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:57,508 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-29 04:47:57,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 04:47:57,509 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-29 04:47:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:47:57,510 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:57,510 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:57,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:47:57,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:47:57,710 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:47:57,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:57,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1166571081, now seen corresponding path program 1 times [2023-11-29 04:47:57,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:47:57,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666987069] [2023-11-29 04:47:57,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:57,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:47:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:58,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:47:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:47:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:58,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 04:47:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:47:58,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:47:58,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666987069] [2023-11-29 04:47:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666987069] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:47:58,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201095914] [2023-11-29 04:47:58,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:58,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:47:58,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:47:58,267 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:47:58,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:47:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:58,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 04:47:58,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:47:58,649 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 21 treesize of output 17 [2023-11-29 04:47:58,655 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 22 treesize of output 14 [2023-11-29 04:47:58,679 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 20 treesize of output 8 [2023-11-29 04:47:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:47:58,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:47:58,693 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 108 treesize of output 78 [2023-11-29 04:47:58,700 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 25 treesize of output 21 [2023-11-29 04:47:58,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:47:58,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:47:58,744 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 8 treesize of output 4 [2023-11-29 04:47:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 04:47:58,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201095914] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:47:58,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:47:58,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 21 [2023-11-29 04:47:58,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138736349] [2023-11-29 04:47:58,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:47:58,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 04:47:58,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:47:58,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 04:47:58,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:47:58,770 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 21 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 04:48:02,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:48:06,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:48:10,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:48:14,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:48:18,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:48:22,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:48:26,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:48:31,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:48:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:31,069 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-11-29 04:48:31,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:48:31,070 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 25 [2023-11-29 04:48:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:31,071 INFO L225 Difference]: With dead ends: 29 [2023-11-29 04:48:31,071 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 04:48:31,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2023-11-29 04:48:31,072 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:31,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 166 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 8 Unknown, 0 Unchecked, 32.2s Time] [2023-11-29 04:48:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 04:48:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-29 04:48:31,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:48:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-11-29 04:48:31,079 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 25 [2023-11-29 04:48:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:31,080 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-11-29 04:48:31,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 04:48:31,080 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-11-29 04:48:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 04:48:31,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:31,081 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:48:31,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 04:48:31,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:48:31,282 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:48:31,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:31,282 INFO L85 PathProgramCache]: Analyzing trace with hash -86702020, now seen corresponding path program 2 times [2023-11-29 04:48:31,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:48:31,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399497970] [2023-11-29 04:48:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:31,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:48:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:48:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:32,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:48:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:33,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 04:48:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:48:33,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:48:33,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399497970] [2023-11-29 04:48:33,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399497970] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:33,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308119541] [2023-11-29 04:48:33,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:48:33,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:48:33,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:48:33,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:48:33,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 04:48:33,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:48:33,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:48:33,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 147 conjunts are in the unsatisfiable core [2023-11-29 04:48:33,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:48:33,701 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-29 04:48:33,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:48:33,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:48:34,044 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:48:34,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 04:48:34,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:48:34,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:48:34,152 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 20 treesize of output 15 [2023-11-29 04:48:34,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:48:34,427 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 45 treesize of output 21 [2023-11-29 04:48:34,433 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 11 treesize of output 3 [2023-11-29 04:48:34,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 04:48:34,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:48:34,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:34,720 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 53 treesize of output 36 [2023-11-29 04:48:34,735 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 04:48:34,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 04:48:34,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-29 04:48:34,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 04:48:34,932 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 59 treesize of output 42 [2023-11-29 04:48:34,939 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 74 treesize of output 46 [2023-11-29 04:48:34,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-29 04:48:34,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-29 04:48:35,327 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:48:35,327 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2023-11-29 04:48:35,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 04:48:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:48:35,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:48:35,690 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse8 (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse8 (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse8 (select .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)))) (.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_903) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2023-11-29 04:48:35,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:48:35,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 192 [2023-11-29 04:48:35,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:48:35,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 171 [2023-11-29 04:48:35,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308119541] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:35,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:48:35,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2023-11-29 04:48:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542602724] [2023-11-29 04:48:35,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:48:35,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-29 04:48:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:48:35,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 04:48:35,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=2042, Unknown=1, NotChecked=90, Total=2256 [2023-11-29 04:48:35,984 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 41 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:48:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:37,316 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2023-11-29 04:48:37,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 04:48:37,317 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2023-11-29 04:48:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:37,318 INFO L225 Difference]: With dead ends: 35 [2023-11-29 04:48:37,318 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 04:48:37,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=237, Invalid=3426, Unknown=1, NotChecked=118, Total=3782 [2023-11-29 04:48:37,321 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:37,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 212 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 04:48:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 04:48:37,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2023-11-29 04:48:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:48:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-11-29 04:48:37,328 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 27 [2023-11-29 04:48:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:37,328 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-29 04:48:37,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:48:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-11-29 04:48:37,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 04:48:37,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:37,330 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:48:37,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 04:48:37,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-29 04:48:37,530 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:48:37,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:37,531 INFO L85 PathProgramCache]: Analyzing trace with hash -86703694, now seen corresponding path program 2 times [2023-11-29 04:48:37,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:48:37,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698273415] [2023-11-29 04:48:37,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:37,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:48:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:38,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:48:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:38,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:48:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 04:48:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:48:38,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:48:38,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698273415] [2023-11-29 04:48:38,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698273415] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:38,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426886894] [2023-11-29 04:48:38,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:48:38,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:48:38,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:48:38,438 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:48:38,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 04:48:38,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:48:38,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:48:38,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-29 04:48:38,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:48:38,738 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-29 04:48:38,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:48:38,916 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 9 treesize of output 3 [2023-11-29 04:48:38,919 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 12 treesize of output 4 [2023-11-29 04:48:39,067 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:48:39,068 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 15 treesize of output 15 [2023-11-29 04:48:39,074 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 21 treesize of output 16 [2023-11-29 04:48:39,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:48:39,163 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 27 [2023-11-29 04:48:39,168 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-29 04:48:39,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:48:39,339 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 04:48:39,339 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2023-11-29 04:48:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:48:39,343 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:48:39,440 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 236 treesize of output 206 [2023-11-29 04:48:39,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:48:39,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 159 [2023-11-29 04:48:39,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426886894] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:39,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:48:39,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 33 [2023-11-29 04:48:39,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381733334] [2023-11-29 04:48:39,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:48:39,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 04:48:39,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:48:39,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 04:48:39,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1303, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 04:48:39,932 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 25 states have internal predecessors, (36), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:48:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:40,618 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-11-29 04:48:40,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 04:48:40,619 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 25 states have internal predecessors, (36), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2023-11-29 04:48:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:40,620 INFO L225 Difference]: With dead ends: 32 [2023-11-29 04:48:40,620 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 04:48:40,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=189, Invalid=2261, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 04:48:40,621 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:40,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 254 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:48:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 04:48:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-11-29 04:48:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:48:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-11-29 04:48:40,628 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 27 [2023-11-29 04:48:40,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:40,629 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-11-29 04:48:40,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 25 states have internal predecessors, (36), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:48:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-11-29 04:48:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:48:40,630 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:40,630 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:48:40,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 04:48:40,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:48:40,831 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:48:40,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1716228745, now seen corresponding path program 3 times [2023-11-29 04:48:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:48:40,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292268049] [2023-11-29 04:48:40,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:40,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:48:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:42,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:48:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:42,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:48:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:42,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 04:48:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:48:43,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:48:43,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292268049] [2023-11-29 04:48:43,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292268049] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:43,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495731015] [2023-11-29 04:48:43,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:48:43,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:48:43,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:48:43,043 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:48:43,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 04:48:43,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 04:48:43,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:48:43,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 143 conjunts are in the unsatisfiable core [2023-11-29 04:48:43,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:48:43,413 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-29 04:48:43,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:48:43,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:48:43,571 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:48:43,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 04:48:43,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:48:43,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:48:43,621 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 27 treesize of output 15 [2023-11-29 04:48:43,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-29 04:48:43,780 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:48:43,781 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2023-11-29 04:48:43,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 04:48:43,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 04:48:44,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:44,026 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 04:48:44,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2023-11-29 04:48:44,044 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 04:48:44,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 04:48:44,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-11-29 04:48:44,206 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 93 treesize of output 61 [2023-11-29 04:48:44,223 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-11-29 04:48:44,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 44 [2023-11-29 04:48:44,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2023-11-29 04:48:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:48:44,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:48:45,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:48:45,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 423 treesize of output 385 [2023-11-29 04:48:45,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:48:45,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 336 [2023-11-29 04:48:45,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495731015] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:45,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:48:45,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 36 [2023-11-29 04:48:45,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039743957] [2023-11-29 04:48:45,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:48:45,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 04:48:45,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:48:45,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 04:48:45,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1689, Unknown=0, NotChecked=0, Total=1806 [2023-11-29 04:48:45,425 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 36 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 04:48:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:46,234 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2023-11-29 04:48:46,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 04:48:46,235 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-11-29 04:48:46,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:46,235 INFO L225 Difference]: With dead ends: 53 [2023-11-29 04:48:46,235 INFO L226 Difference]: Without dead ends: 48 [2023-11-29 04:48:46,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=174, Invalid=2376, Unknown=0, NotChecked=0, Total=2550 [2023-11-29 04:48:46,237 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:46,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 177 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:48:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-29 04:48:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2023-11-29 04:48:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:48:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2023-11-29 04:48:46,244 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 29 [2023-11-29 04:48:46,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:46,245 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2023-11-29 04:48:46,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 04:48:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2023-11-29 04:48:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:48:46,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:46,246 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:48:46,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 04:48:46,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 04:48:46,447 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:48:46,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:46,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1716230419, now seen corresponding path program 3 times [2023-11-29 04:48:46,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:48:46,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327084271] [2023-11-29 04:48:46,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:46,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:48:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:46,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:48:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:46,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:48:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:46,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 04:48:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:46,599 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 04:48:46,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:48:46,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327084271] [2023-11-29 04:48:46,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327084271] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:46,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129221066] [2023-11-29 04:48:46,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:48:46,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:48:46,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:48:46,601 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:48:46,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 04:48:46,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 04:48:46,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:48:46,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 04:48:46,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:48:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 04:48:46,969 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:48:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 04:48:47,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129221066] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:48:47,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:48:47,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-11-29 04:48:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941246111] [2023-11-29 04:48:47,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:48:47,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:48:47,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:48:47,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:48:47,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:48:47,025 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:48:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:47,109 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2023-11-29 04:48:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:48:47,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-11-29 04:48:47,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:47,110 INFO L225 Difference]: With dead ends: 51 [2023-11-29 04:48:47,110 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 04:48:47,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:48:47,111 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:47,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 92 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:48:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 04:48:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-11-29 04:48:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 04:48:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-11-29 04:48:47,117 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 29 [2023-11-29 04:48:47,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:47,117 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-29 04:48:47,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:48:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-11-29 04:48:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 04:48:47,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:47,118 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:48:47,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 04:48:47,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 04:48:47,319 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:48:47,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2125367058, now seen corresponding path program 4 times [2023-11-29 04:48:47,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:48:47,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91643626] [2023-11-29 04:48:47,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:47,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:48:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:47,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:48:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:48:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:47,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:48:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:47,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:48:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 04:48:47,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:48:47,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91643626] [2023-11-29 04:48:47,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91643626] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102481014] [2023-11-29 04:48:47,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:48:47,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:48:47,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:48:47,436 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:48:47,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 04:48:47,614 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:48:47,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:48:47,619 WARN L260 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 201 conjunts are in the unsatisfiable core [2023-11-29 04:48:47,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:48:47,633 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-29 04:48:47,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:48:47,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:48:47,791 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:48:47,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 04:48:47,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 04:48:47,813 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:48:47,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 04:48:47,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:48:47,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:48:47,867 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 20 treesize of output 15 [2023-11-29 04:48:47,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-29 04:48:48,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:48,055 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 41 treesize of output 32 [2023-11-29 04:48:48,070 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 04:48:48,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2023-11-29 04:48:48,104 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-11-29 04:48:48,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-11-29 04:48:48,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:48:48,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-29 04:48:48,205 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 76 treesize of output 40 [2023-11-29 04:48:48,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-11-29 04:48:48,435 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:48:48,435 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 56 [2023-11-29 04:48:48,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2023-11-29 04:48:48,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 04:48:48,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2023-11-29 04:48:48,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:48,649 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 04:48:48,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 78 [2023-11-29 04:48:48,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:48,673 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2023-11-29 04:48:48,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2023-11-29 04:48:48,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:48,709 INFO L349 Elim1Store]: treesize reduction 12, result has 75.5 percent of original size [2023-11-29 04:48:48,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 49 [2023-11-29 04:48:48,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-29 04:48:48,867 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 149 treesize of output 101 [2023-11-29 04:48:48,885 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-11-29 04:48:48,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 64 [2023-11-29 04:48:48,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-29 04:48:48,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:48,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:48:48,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2023-11-29 04:48:49,453 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 04:48:49,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 66 [2023-11-29 04:48:49,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 04:48:49,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-11-29 04:48:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:48:49,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:48:50,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:48:50,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 518 treesize of output 472 [2023-11-29 04:48:50,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:48:50,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 462 treesize of output 416 [2023-11-29 04:48:50,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102481014] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:50,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:48:50,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 29] total 33 [2023-11-29 04:48:50,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564999316] [2023-11-29 04:48:50,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:48:50,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 04:48:50,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:48:50,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 04:48:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1621, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 04:48:50,402 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 25 states have internal predecessors, (42), 7 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-29 04:48:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:50,842 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2023-11-29 04:48:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:48:50,842 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 1.5) internal successors, (42), 25 states have internal predecessors, (42), 7 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 35 [2023-11-29 04:48:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:50,843 INFO L225 Difference]: With dead ends: 35 [2023-11-29 04:48:50,843 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 04:48:50,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=129, Invalid=2033, Unknown=0, NotChecked=0, Total=2162 [2023-11-29 04:48:50,845 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:50,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:48:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 04:48:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 04:48:50,846 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-29 04:48:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 04:48:50,846 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2023-11-29 04:48:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:50,846 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:48:50,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 1.5) internal successors, (42), 25 states have internal predecessors, (42), 7 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-29 04:48:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:48:50,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 04:48:50,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:48:50,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 04:48:51,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 04:48:51,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 04:48:51,548 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-11-29 04:48:51,548 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 604 626) no Hoare annotation was computed. [2023-11-29 04:48:51,548 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse11 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))) (let ((.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (not .cse11)) (.cse3 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse4 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse5 (= (select (select |#memory_int#1| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1)) (.cse10 (= .cse0 0)) (.cse6 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (= |ULTIMATE.start_sll_create_~data#1| 1))) (or (and (= (select (select |#memory_$Pointer$#1.base| .cse0) 4) 0) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_sll_create_~len#1| 0) .cse4 (= (select (select |#memory_int#1| .cse0) 0) 1) (= (select |#valid| .cse0) 1) .cse5 .cse6 .cse7 .cse8 .cse9 (not .cse10) (= (select (select |#memory_$Pointer$#1.offset| .cse0) 4) 0)) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse3 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_sll_create_~len#1| 1) .cse5 .cse10 .cse6 .cse7 .cse8 .cse9)))) [2023-11-29 04:48:51,549 INFO L899 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2023-11-29 04:48:51,549 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2023-11-29 04:48:51,549 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse0 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_sll_create_~data#1| 1))) (or (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not .cse1) .cse0 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |ULTIMATE.start_sll_create_~len#1| 1) (= (select (select |#memory_int#1| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) .cse2 .cse3 .cse4 .cse5))) [2023-11-29 04:48:51,549 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-11-29 04:48:51,550 INFO L895 garLoopResultBuilder]: At program point L611-2(lines 611 618) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~ptr~0#1.base| 0))) (let ((.cse4 (= (select (select |#memory_int#1| |ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) (.cse5 (not .cse1)) (.cse0 (= |ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (= |ULTIMATE.start_main_~count~0#1| 3) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int)) (let ((.cse7 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse6 (select (select |#memory_$Pointer$#1.base| .cse7) 4))) (and (= (select (select |#memory_$Pointer$#1.base| .cse6) 4) 0) (not (= .cse6 |v_ULTIMATE.start_main_~ptr~0#1.base_26|)) (not (= .cse6 .cse7)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse6) (= (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= 0 (select (select |#memory_$Pointer$#1.offset| .cse6) 4)) (= (select (select |#memory_$Pointer$#1.offset| .cse7) 4) 0))))) .cse0 .cse8 .cse2 .cse3 (= 2 |ULTIMATE.start_main_~count~0#1|)) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_26| Int)) (let ((.cse10 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4))) (let ((.cse9 (select (select |#memory_$Pointer$#1.base| .cse10) 4))) (and (= (select (select |#memory_$Pointer$#1.base| .cse9) 4) 0) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse10) (not (= .cse9 |v_ULTIMATE.start_main_~ptr~0#1.base_26|)) (not (= .cse9 .cse10)) (= (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_26|) 4) 0) (= 0 (select (select |#memory_$Pointer$#1.offset| .cse9) 4)) (= (select (select |#memory_$Pointer$#1.offset| .cse10) 4) 0))))) (= |ULTIMATE.start_main_~count~0#1| 1) .cse4 .cse5 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (let ((.cse11 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4))) (and (not (= (select (select |#memory_$Pointer$#1.base| .cse11) 4) 0)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse11) (not (= .cse11 |v_ULTIMATE.start_main_~ptr~0#1.base_22|))))) .cse0 .cse8 .cse2 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_18| Int)) (let ((.cse13 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 4))) (let ((.cse12 (select (select |#memory_$Pointer$#1.base| .cse13) 4))) (and (not (= .cse12 |v_ULTIMATE.start_main_~ptr~0#1.base_18|)) (= (select (select |#memory_int#1| .cse12) 0) 1) (not (= .cse12 .cse13)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse13) (= (select (select |#memory_$Pointer$#1.offset| .cse13) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 4) 0))))) .cse3) (let ((.cse15 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse14 (select (select |#memory_$Pointer$#1.base| .cse15) 4))) (and (= (select (select |#memory_$Pointer$#1.base| .cse14) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse14) 4) 0) .cse4 .cse5 (= (select (select |#memory_int#1| .cse14) 0) 1) (= (select (select |#memory_int#1| .cse15) 0) 1) .cse0 (= |ULTIMATE.start_main_~count~0#1| 0) (not (= .cse15 0)) (not (= .cse14 0)) .cse8 .cse2 .cse3 (= (select (select |#memory_$Pointer$#1.offset| .cse15) 4) 0))))))) [2023-11-29 04:48:51,550 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 04:48:51,550 INFO L899 garLoopResultBuilder]: For program point L611-3(lines 604 626) no Hoare annotation was computed. [2023-11-29 04:48:51,550 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 04:48:51,550 INFO L895 garLoopResultBuilder]: At program point L600(line 600) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select |#valid| .cse0) 1) (= (select (select |#memory_$Pointer$#1.base| .cse1) 4) 0) (= |ULTIMATE.start_sll_prepend_~data#1| 1) (not (= .cse0 0)) (= |ULTIMATE.start_sll_prepend_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |#memory_int#1| .cse1) 0) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| .cse1) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_int#1| .cse0) 0) 1) (= (select (select |#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |ULTIMATE.start_sll_prepend_~head#1.offset| 0) (not (= .cse1 0))))) [2023-11-29 04:48:51,550 INFO L899 garLoopResultBuilder]: For program point L600-1(line 600) no Hoare annotation was computed. [2023-11-29 04:48:51,550 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 604 626) no Hoare annotation was computed. [2023-11-29 04:48:51,550 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2023-11-29 04:48:51,551 INFO L899 garLoopResultBuilder]: For program point L613(lines 613 615) no Hoare annotation was computed. [2023-11-29 04:48:51,551 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-11-29 04:48:51,551 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-11-29 04:48:51,551 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) [2023-11-29 04:48:51,551 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-11-29 04:48:51,554 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1] [2023-11-29 04:48:51,556 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:48:51,572 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~ptr~0!base][0] could not be translated [2023-11-29 04:48:51,573 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_26 : int :: (((((#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4]][4] == 0 && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_26)) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4])) && ~ptr~0!base == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4]) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~ptr~0#1.base_26][4] == 0) && 0 == #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4]][4]) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4] == 0) could not be translated [2023-11-29 04:48:51,573 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_26 : int :: (((((#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4]][4] == 0 && ~ptr~0!base == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_26)) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4])) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~ptr~0#1.base_26][4] == 0) && 0 == #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4]][4]) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4] == 0) could not be translated [2023-11-29 04:48:51,573 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~ptr~0!base][0] could not be translated [2023-11-29 04:48:51,573 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_22 : int :: (!(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_22][4]][4] == 0) && ~ptr~0!base == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_22][4]) && !(#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_22][4] == v_ULTIMATE.start_main_~ptr~0#1.base_22)) could not be translated [2023-11-29 04:48:51,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_18 : int :: ((((!(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_18][4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_18) && #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_18][4]][4]][0] == 1) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_18][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_18][4])) && ~ptr~0!base == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_18][4]) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_18][4]][4] == 0) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~ptr~0#1.base_18][4] == 0) could not be translated [2023-11-29 04:48:51,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4]][4] could not be translated [2023-11-29 04:48:51,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~ptr~0!base][4] could not be translated [2023-11-29 04:48:51,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4]][4] could not be translated [2023-11-29 04:48:51,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~ptr~0!base][0] could not be translated [2023-11-29 04:48:51,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4]][0] could not be translated [2023-11-29 04:48:51,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~ptr~0!base][4]][0] could not be translated [2023-11-29 04:48:51,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~ptr~0!base][4] could not be translated [2023-11-29 04:48:51,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4] could not be translated [2023-11-29 04:48:51,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~ptr~0!base][4]][4] could not be translated [2023-11-29 04:48:51,578 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-29 04:48:51,578 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-29 04:48:51,579 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-11-29 04:48:51,579 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head~0!base][4]][0] could not be translated [2023-11-29 04:48:51,579 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated [2023-11-29 04:48:51,579 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head~0!base][0] could not be translated [2023-11-29 04:48:51,579 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-29 04:48:51,580 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-29 04:48:51,580 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-29 04:48:51,580 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-11-29 04:48:51,581 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head~0!base][0] could not be translated [2023-11-29 04:48:51,581 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-29 04:48:51,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:48:51 BoogieIcfgContainer [2023-11-29 04:48:51,582 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:48:51,583 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:48:51,583 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:48:51,583 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:48:51,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:47:50" (3/4) ... [2023-11-29 04:48:51,585 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 04:48:51,589 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-11-29 04:48:51,594 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-29 04:48:51,594 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 04:48:51,594 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 04:48:51,595 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 04:48:51,690 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:48:51,691 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 04:48:51,691 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:48:51,692 INFO L158 Benchmark]: Toolchain (without parser) took 62085.92ms. Allocated memory was 163.6MB in the beginning and 293.6MB in the end (delta: 130.0MB). Free memory was 121.5MB in the beginning and 98.6MB in the end (delta: 22.9MB). Peak memory consumption was 154.4MB. Max. memory is 16.1GB. [2023-11-29 04:48:51,692 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:48:51,693 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.42ms. Allocated memory is still 163.6MB. Free memory was 121.0MB in the beginning and 103.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 04:48:51,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.36ms. Allocated memory is still 163.6MB. Free memory was 103.7MB in the beginning and 101.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:48:51,693 INFO L158 Benchmark]: Boogie Preprocessor took 51.16ms. Allocated memory is still 163.6MB. Free memory was 101.6MB in the beginning and 98.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:48:51,694 INFO L158 Benchmark]: RCFGBuilder took 408.75ms. Allocated memory is still 163.6MB. Free memory was 98.4MB in the beginning and 81.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 04:48:51,694 INFO L158 Benchmark]: TraceAbstraction took 61054.55ms. Allocated memory was 163.6MB in the beginning and 293.6MB in the end (delta: 130.0MB). Free memory was 80.6MB in the beginning and 103.8MB in the end (delta: -23.2MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. [2023-11-29 04:48:51,694 INFO L158 Benchmark]: Witness Printer took 108.39ms. Allocated memory is still 293.6MB. Free memory was 103.8MB in the beginning and 98.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 04:48:51,696 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.21ms. Allocated memory is still 163.6MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.42ms. Allocated memory is still 163.6MB. Free memory was 121.0MB in the beginning and 103.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.36ms. Allocated memory is still 163.6MB. Free memory was 103.7MB in the beginning and 101.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.16ms. Allocated memory is still 163.6MB. Free memory was 101.6MB in the beginning and 98.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 408.75ms. Allocated memory is still 163.6MB. Free memory was 98.4MB in the beginning and 81.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 61054.55ms. Allocated memory was 163.6MB in the beginning and 293.6MB in the end (delta: 130.0MB). Free memory was 80.6MB in the beginning and 103.8MB in the end (delta: -23.2MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. * Witness Printer took 108.39ms. Allocated memory is still 293.6MB. Free memory was 103.8MB in the beginning and 98.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~ptr~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_26 : int :: (((((#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4]][4] == 0 && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_26)) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4])) && ~ptr~0!base == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4]) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~ptr~0#1.base_26][4] == 0) && 0 == #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4]][4]) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_26 : int :: (((((#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4]][4] == 0 && ~ptr~0!base == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_26)) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4])) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~ptr~0#1.base_26][4] == 0) && 0 == #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4]][4]) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_26][4]][4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~ptr~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_22 : int :: (!(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_22][4]][4] == 0) && ~ptr~0!base == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_22][4]) && !(#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_22][4] == v_ULTIMATE.start_main_~ptr~0#1.base_22)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_18 : int :: ((((!(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_18][4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_18) && #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_18][4]][4]][0] == 1) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_18][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_18][4])) && ~ptr~0!base == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_18][4]) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_18][4]][4] == 0) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~ptr~0#1.base_18][4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~ptr~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~ptr~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~ptr~0!base][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~ptr~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~ptr~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head~0!base][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated * 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: 624]: 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 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.0s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 37.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 34.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 1296 SdHoareTripleChecker+Invalid, 34.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1165 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2744 IncrementalHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 131 mSDtfsCounter, 2744 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 245 SyntacticMatches, 4 SemanticMatches, 306 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2073 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=10, InterpolantAutomatonStates: 145, 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, 12 MinimizatonAttempts, 21 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 13 PreInvPairs, 24 NumberOfFragments, 853 HoareAnnotationTreeSize, 13 FomulaSimplifications, 266 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 203 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 496 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 544 ConstructedInterpolants, 37 QuantifiedInterpolants, 7447 SizeOfPredicates, 161 NumberOfNonLiveVariables, 2701 ConjunctsInSsa, 748 ConjunctsInUnsatCore, 23 InterpolantComputations, 4 PerfectInterpolantSequences, 220/398 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: No data available, 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: 611]: Loop Invariant Derived loop invariant: (((((count == 3) && (len == 2)) || (((data == 1) && (len == 2)) && (2 == count))) || (((count == 1) && (data == 1)) && (len == 2))) || (((count == 0) && (data == 1)) && (len == 2))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((len <= 0) && (data == 1)) && (len == 2)) && (data == 1)) || ((((2 == len) && (data == 1)) && (len == 2)) && (data == 1))) || ((((len == 1) && (data == 1)) && (len == 2)) && (data == 1))) RESULT: Ultimate proved your program to be correct! [2023-11-29 04:48:51,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ca670e-18b7-4295-b41e-b103fd6fd921/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE