./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.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_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/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_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/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_d05704b4-2b9d-41bd-8b37-12adf45a5910/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 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:26:13,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:26:13,076 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:26:13,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:26:13,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:26:13,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:26:13,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:26:13,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:26:13,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:26:13,116 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:26:13,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:26:13,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:26:13,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:26:13,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:26:13,118 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:26:13,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:26:13,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:26:13,120 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:26:13,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:26:13,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:26:13,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:26:13,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:26:13,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:26:13,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:26:13,123 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:26:13,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:26:13,124 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:26:13,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:26:13,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:26:13,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:26:13,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:26:13,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:26:13,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:26:13,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:26:13,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:26:13,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:26:13,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:26:13,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:26:13,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:26:13,128 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:26:13,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:26:13,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:26:13,129 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_d05704b4-2b9d-41bd-8b37-12adf45a5910/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_d05704b4-2b9d-41bd-8b37-12adf45a5910/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 -> 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 [2023-11-29 03:26:13,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:26:13,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:26:13,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:26:13,406 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:26:13,407 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:26:13,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2023-11-29 03:26:16,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:26:16,405 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:26:16,406 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2023-11-29 03:26:16,419 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/data/e081e2483/ffddcaaa630b4714b28c2aff648d9fc1/FLAG62d3ed912 [2023-11-29 03:26:16,433 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/data/e081e2483/ffddcaaa630b4714b28c2aff648d9fc1 [2023-11-29 03:26:16,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:26:16,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:26:16,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:26:16,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:26:16,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:26:16,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ab2a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16, skipping insertion in model container [2023-11-29 03:26:16,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,490 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:26:16,740 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_d05704b4-2b9d-41bd-8b37-12adf45a5910/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288] [2023-11-29 03:26:16,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:26:16,754 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:26:16,795 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_d05704b4-2b9d-41bd-8b37-12adf45a5910/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288] [2023-11-29 03:26:16,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:26:16,823 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:26:16,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16 WrapperNode [2023-11-29 03:26:16,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:26:16,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:26:16,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:26:16,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:26:16,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,865 INFO L138 Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2023-11-29 03:26:16,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:26:16,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:26:16,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:26:16,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:26:16,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,901 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 8, 6]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2023-11-29 03:26:16,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:26:16,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:26:16,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:26:16,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:26:16,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16" (1/1) ... [2023-11-29 03:26:16,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:26:16,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:26:16,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:26:16,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:26:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-29 03:26:16,974 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-29 03:26:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:26:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:26:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:26:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:26:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:26:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:26:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:26:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:26:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:26:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:26:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:26:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:26:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:26:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 03:26:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 03:26:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 03:26:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:26:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:26:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:26:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:26:16,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:26:17,093 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:26:17,095 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:26:17,116 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-29 03:26:17,245 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:26:17,270 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:26:17,271 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 03:26:17,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:26:17 BoogieIcfgContainer [2023-11-29 03:26:17,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:26:17,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:26:17,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:26:17,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:26:17,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:26:16" (1/3) ... [2023-11-29 03:26:17,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3d6bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:26:17, skipping insertion in model container [2023-11-29 03:26:17,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:26:16" (2/3) ... [2023-11-29 03:26:17,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3d6bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:26:17, skipping insertion in model container [2023-11-29 03:26:17,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:26:17" (3/3) ... [2023-11-29 03:26:17,280 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.i [2023-11-29 03:26:17,295 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:26:17,295 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:26:17,334 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:26:17,340 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;@7b47d579, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:26:17,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:26:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 03:26:17,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:17,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:26:17,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:26:17,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1787827891, now seen corresponding path program 1 times [2023-11-29 03:26:17,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:26:17,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001063560] [2023-11-29 03:26:17,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:17,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:26:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:17,492 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 03:26:17,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:26:17,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001063560] [2023-11-29 03:26:17,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001063560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:26:17,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:26:17,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:26:17,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601042494] [2023-11-29 03:26:17,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:26:17,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:26:17,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:26:17,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:26:17,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:26:17,530 INFO L87 Difference]: Start difference. First operand has 22 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:17,551 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2023-11-29 03:26:17,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:26:17,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 03:26:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:17,558 INFO L225 Difference]: With dead ends: 35 [2023-11-29 03:26:17,559 INFO L226 Difference]: Without dead ends: 17 [2023-11-29 03:26:17,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:26:17,564 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:17,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:26:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-29 03:26:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-29 03:26:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-29 03:26:17,596 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 7 [2023-11-29 03:26:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:17,597 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-29 03:26:17,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:17,597 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-11-29 03:26:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 03:26:17,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:17,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:26:17,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:26:17,598 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:26:17,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1243069665, now seen corresponding path program 1 times [2023-11-29 03:26:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:26:17,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298916318] [2023-11-29 03:26:17,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:17,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:26:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:17,700 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 03:26:17,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:26:17,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298916318] [2023-11-29 03:26:17,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298916318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:26:17,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:26:17,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:26:17,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287587871] [2023-11-29 03:26:17,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:26:17,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:26:17,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:26:17,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:26:17,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:26:17,703 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:17,722 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-11-29 03:26:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:26:17,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 03:26:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:17,723 INFO L225 Difference]: With dead ends: 33 [2023-11-29 03:26:17,724 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 03:26:17,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:26:17,726 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:17,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 31 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:26:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 03:26:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2023-11-29 03:26:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-29 03:26:17,732 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 7 [2023-11-29 03:26:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:17,732 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-29 03:26:17,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-29 03:26:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 03:26:17,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:17,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:26:17,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:26:17,734 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:26:17,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:17,735 INFO L85 PathProgramCache]: Analyzing trace with hash 817197517, now seen corresponding path program 1 times [2023-11-29 03:26:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:26:17,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090698000] [2023-11-29 03:26:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:26:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:26:17,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:26:17,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090698000] [2023-11-29 03:26:17,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090698000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:26:17,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:26:17,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:26:17,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465864736] [2023-11-29 03:26:17,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:26:17,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:26:17,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:26:17,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:26:17,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:26:17,836 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:17,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:17,863 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-11-29 03:26:17,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:26:17,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 03:26:17,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:17,865 INFO L225 Difference]: With dead ends: 38 [2023-11-29 03:26:17,865 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 03:26:17,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:26:17,867 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:17,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:26:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 03:26:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2023-11-29 03:26:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-29 03:26:17,872 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2023-11-29 03:26:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:17,873 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-29 03:26:17,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-29 03:26:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 03:26:17,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:17,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:26:17,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:26:17,874 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:26:17,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:17,875 INFO L85 PathProgramCache]: Analyzing trace with hash 7850891, now seen corresponding path program 1 times [2023-11-29 03:26:17,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:26:17,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427202331] [2023-11-29 03:26:17,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:17,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:26:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:26:17,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:26:17,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427202331] [2023-11-29 03:26:17,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427202331] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:26:17,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71042678] [2023-11-29 03:26:17,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:17,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:26:17,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:26:17,981 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:26:17,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:26:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:18,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:26:18,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:26:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:26:18,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:26:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:26:18,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71042678] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:26:18,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:26:18,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-11-29 03:26:18,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871059008] [2023-11-29 03:26:18,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:26:18,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:26:18,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:26:18,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:26:18,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:26:18,224 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:18,245 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-11-29 03:26:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:26:18,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 03:26:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:18,247 INFO L225 Difference]: With dead ends: 34 [2023-11-29 03:26:18,247 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 03:26:18,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:26:18,248 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:18,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 31 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:26:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 03:26:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-29 03:26:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 03:26:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-11-29 03:26:18,254 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2023-11-29 03:26:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:18,254 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-11-29 03:26:18,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-11-29 03:26:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 03:26:18,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:18,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:26:18,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:26:18,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:26:18,460 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:26:18,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2084961635, now seen corresponding path program 1 times [2023-11-29 03:26:18,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:26:18,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181905541] [2023-11-29 03:26:18,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:18,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:26:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:26:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:26:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181905541] [2023-11-29 03:26:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181905541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:26:18,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:26:18,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:26:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988633859] [2023-11-29 03:26:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:26:18,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:26:18,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:26:18,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:26:18,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:26:18,564 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 03:26:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:18,586 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-11-29 03:26:18,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:26:18,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 03:26:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:18,587 INFO L225 Difference]: With dead ends: 33 [2023-11-29 03:26:18,587 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 03:26:18,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:26:18,589 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:18,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 33 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:26:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 03:26:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-11-29 03:26:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 03:26:18,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-11-29 03:26:18,594 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2023-11-29 03:26:18,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:18,595 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-29 03:26:18,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 03:26:18,595 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-11-29 03:26:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 03:26:18,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:18,596 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:26:18,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:26:18,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:26:18,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:18,597 INFO L85 PathProgramCache]: Analyzing trace with hash 373946164, now seen corresponding path program 1 times [2023-11-29 03:26:18,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:26:18,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814923213] [2023-11-29 03:26:18,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:18,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:26:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:26:18,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:26:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814923213] [2023-11-29 03:26:18,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814923213] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:26:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914409945] [2023-11-29 03:26:18,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:18,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:26:18,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:26:18,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:26:18,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:26:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:18,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:26:18,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:26:18,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:26:18,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:26:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:26:18,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914409945] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:26:18,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:26:18,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-11-29 03:26:18,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280842959] [2023-11-29 03:26:18,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:26:18,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:26:18,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:26:18,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:26:18,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:26:18,929 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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 03:26:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:18,961 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2023-11-29 03:26:18,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:26:18,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-29 03:26:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:18,963 INFO L225 Difference]: With dead ends: 34 [2023-11-29 03:26:18,963 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 03:26:18,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:26:18,964 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 61 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:18,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:26:18,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 03:26:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 03:26:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-11-29 03:26:18,971 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2023-11-29 03:26:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:18,971 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-11-29 03:26:18,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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 03:26:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-11-29 03:26:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 03:26:18,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:18,972 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:26:18,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:26:19,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:26:19,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:26:19,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:19,174 INFO L85 PathProgramCache]: Analyzing trace with hash 183918531, now seen corresponding path program 2 times [2023-11-29 03:26:19,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:26:19,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326498573] [2023-11-29 03:26:19,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:26:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:26:19,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:26:19,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326498573] [2023-11-29 03:26:19,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326498573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:26:19,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:26:19,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:26:19,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892505828] [2023-11-29 03:26:19,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:26:19,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:26:19,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:26:19,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:26:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:26:19,438 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 03:26:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:19,496 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-29 03:26:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:26:19,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-29 03:26:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:19,497 INFO L225 Difference]: With dead ends: 42 [2023-11-29 03:26:19,497 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 03:26:19,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:26:19,498 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:19,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 61 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:26:19,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 03:26:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 03:26:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-29 03:26:19,504 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2023-11-29 03:26:19,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:19,504 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-29 03:26:19,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 03:26:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-29 03:26:19,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 03:26:19,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:19,505 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:26:19,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:26:19,505 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:26:19,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:19,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1945264861, now seen corresponding path program 1 times [2023-11-29 03:26:19,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:26:19,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347396025] [2023-11-29 03:26:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:19,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:26:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:26:20,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:26:20,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347396025] [2023-11-29 03:26:20,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347396025] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:26:20,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375322272] [2023-11-29 03:26:20,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:20,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:26:20,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:26:20,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:26:20,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:26:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:20,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 03:26:20,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:26:20,940 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 33 [2023-11-29 03:26:20,946 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 37 treesize of output 25 [2023-11-29 03:26:20,999 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 31 treesize of output 19 [2023-11-29 03:26:21,005 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 13 [2023-11-29 03:26:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 03:26:21,029 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:26:21,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375322272] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:26:21,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:26:21,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2023-11-29 03:26:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267345353] [2023-11-29 03:26:21,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:26:21,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:26:21,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:26:21,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:26:21,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:26:21,031 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 03:26:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:21,097 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2023-11-29 03:26:21,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:26:21,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 03:26:21,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:21,098 INFO L225 Difference]: With dead ends: 47 [2023-11-29 03:26:21,099 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 03:26:21,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:26:21,100 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:21,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:26:21,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 03:26:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-29 03:26:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 03:26:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-11-29 03:26:21,106 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 29 [2023-11-29 03:26:21,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:21,106 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-11-29 03:26:21,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 03:26:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-11-29 03:26:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 03:26:21,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:21,108 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:26:21,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 03:26:21,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:26:21,314 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:26:21,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash -538470291, now seen corresponding path program 1 times [2023-11-29 03:26:21,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:26:21,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992734096] [2023-11-29 03:26:21,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:21,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:26:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:26:22,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:26:22,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992734096] [2023-11-29 03:26:22,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992734096] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:26:22,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113178117] [2023-11-29 03:26:22,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:22,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:26:22,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:26:22,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:26:22,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:26:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:22,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 03:26:22,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:26:22,411 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 25 treesize of output 17 [2023-11-29 03:26:22,417 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 25 treesize of output 17 [2023-11-29 03:26:22,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-11-29 03:26:22,512 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 34 treesize of output 22 [2023-11-29 03:26:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:26:22,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:26:22,622 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 51 treesize of output 37 [2023-11-29 03:26:22,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:26:22,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:26:22,722 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 03:26:22,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 03:26:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:26:22,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113178117] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:26:22,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:26:22,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2023-11-29 03:26:22,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930877258] [2023-11-29 03:26:22,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:26:22,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 03:26:22,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:26:22,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 03:26:22,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2023-11-29 03:26:22,755 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 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 03:26:23,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:23,231 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2023-11-29 03:26:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:26:23,232 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-29 03:26:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:23,233 INFO L225 Difference]: With dead ends: 63 [2023-11-29 03:26:23,233 INFO L226 Difference]: Without dead ends: 45 [2023-11-29 03:26:23,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 03:26:23,234 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 73 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:23,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 83 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:26:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-29 03:26:23,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2023-11-29 03:26:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-11-29 03:26:23,242 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 33 [2023-11-29 03:26:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:23,242 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-11-29 03:26:23,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 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 03:26:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-11-29 03:26:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 03:26:23,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:23,244 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:26:23,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 03:26:23,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-29 03:26:23,448 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:26:23,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:23,448 INFO L85 PathProgramCache]: Analyzing trace with hash 808788562, now seen corresponding path program 2 times [2023-11-29 03:26:23,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:26:23,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385841455] [2023-11-29 03:26:23,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:23,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:26:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 03:26:24,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:26:24,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385841455] [2023-11-29 03:26:24,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385841455] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:26:24,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476282601] [2023-11-29 03:26:24,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:26:24,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:26:24,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:26:24,787 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:26:24,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:26:25,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:26:25,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:26:25,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 94 conjunts are in the unsatisfiable core [2023-11-29 03:26:25,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:26:25,147 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 03:26:25,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-29 03:26:25,205 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 14 treesize of output 15 [2023-11-29 03:26:25,335 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:26:25,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 03:26:25,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 17 [2023-11-29 03:26:25,453 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 16 [2023-11-29 03:26:25,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 17 [2023-11-29 03:26:25,475 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 03:26:25,558 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:26:25,559 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 1 case distinctions, treesize of input 80 treesize of output 57 [2023-11-29 03:26:25,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2023-11-29 03:26:25,917 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 99 treesize of output 63 [2023-11-29 03:26:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 03:26:26,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:26:26,381 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 84 treesize of output 64 [2023-11-29 03:26:26,384 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 68 treesize of output 48 [2023-11-29 03:26:26,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:26:26,585 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 2 case distinctions, treesize of input 129 treesize of output 106 [2023-11-29 03:26:26,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:26:26,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 86 [2023-11-29 03:26:26,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:26:26,622 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 2 case distinctions, treesize of input 129 treesize of output 106 [2023-11-29 03:26:26,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:26:26,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 86 [2023-11-29 03:26:26,653 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_5 .cse0))) (= (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_5))) (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (select (select .cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_6))) (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (+ (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 4))) 0))) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (or (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_3))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_4))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 4)) 0) (not (= (select v_arrayElimArr_3 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_4 .cse0))))))) is different from false [2023-11-29 03:26:27,301 INFO L349 Elim1Store]: treesize reduction 651, result has 11.1 percent of original size [2023-11-29 03:26:27,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1264 treesize of output 868 [2023-11-29 03:26:27,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:26:27,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 571 treesize of output 516 [2023-11-29 03:26:27,364 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 618 treesize of output 604 [2023-11-29 03:26:27,413 INFO L349 Elim1Store]: treesize reduction 8, result has 79.5 percent of original size [2023-11-29 03:26:27,414 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 821 treesize of output 788 [2023-11-29 03:26:27,476 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 432 treesize of output 414 [2023-11-29 03:26:27,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:26:27,512 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 577 treesize of output 533 [2023-11-29 03:26:27,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-29 03:26:27,607 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 17 treesize of output 9 [2023-11-29 03:26:27,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:26:27,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 189 treesize of output 194 [2023-11-29 03:26:27,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:26:27,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:26:27,724 INFO L349 Elim1Store]: treesize reduction 162, result has 43.4 percent of original size [2023-11-29 03:26:27,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1199 treesize of output 955 [2023-11-29 03:26:27,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 521 treesize of output 499 [2023-11-29 03:26:27,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:26:27,773 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 301 treesize of output 297 [2023-11-29 03:26:27,861 INFO L349 Elim1Store]: treesize reduction 23, result has 67.1 percent of original size [2023-11-29 03:26:27,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 666 treesize of output 649 [2023-11-29 03:26:27,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:26:27,905 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 571 treesize of output 533 [2023-11-29 03:26:27,954 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 476 treesize of output 454 [2023-11-29 03:26:28,123 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 24 treesize of output 12 [2023-11-29 03:26:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2023-11-29 03:26:28,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476282601] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:26:28,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:26:28,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2023-11-29 03:26:28,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648731314] [2023-11-29 03:26:28,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:26:28,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 03:26:28,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:26:28,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 03:26:28,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1217, Unknown=2, NotChecked=70, Total=1406 [2023-11-29 03:26:28,314 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 37 states have internal predecessors, (65), 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 03:26:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:29,743 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2023-11-29 03:26:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:26:29,744 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 37 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-11-29 03:26:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:29,745 INFO L225 Difference]: With dead ends: 89 [2023-11-29 03:26:29,745 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 03:26:29,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=254, Invalid=2100, Unknown=2, NotChecked=94, Total=2450 [2023-11-29 03:26:29,747 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 42 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:29,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 161 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 449 Invalid, 0 Unknown, 44 Unchecked, 0.6s Time] [2023-11-29 03:26:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 03:26:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2023-11-29 03:26:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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 03:26:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-11-29 03:26:29,754 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 35 [2023-11-29 03:26:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:29,754 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-11-29 03:26:29,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 37 states have internal predecessors, (65), 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 03:26:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-11-29 03:26:29,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 03:26:29,755 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:29,756 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:26:29,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:26:29,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 03:26:29,956 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:26:29,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 978345338, now seen corresponding path program 3 times [2023-11-29 03:26:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:26:29,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102572472] [2023-11-29 03:26:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:29,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:26:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 03:26:30,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:26:30,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102572472] [2023-11-29 03:26:30,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102572472] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:26:30,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202530475] [2023-11-29 03:26:30,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 03:26:30,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:26:30,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:26:30,078 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:26:30,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:26:30,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 03:26:30,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:26:30,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:26:30,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:26:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 03:26:30,768 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:26:30,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202530475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:26:30,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:26:30,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-29 03:26:30,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671793964] [2023-11-29 03:26:30,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:26:30,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:26:30,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:26:30,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:26:30,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:26:30,770 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 03:26:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:30,781 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2023-11-29 03:26:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:26:30,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-11-29 03:26:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:30,782 INFO L225 Difference]: With dead ends: 46 [2023-11-29 03:26:30,782 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 03:26:30,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:26:30,783 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:30,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:26:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 03:26:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 03:26:30,784 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 03:26:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 03:26:30,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2023-11-29 03:26:30,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:30,784 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 03:26:30,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 03:26:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 03:26:30,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 03:26:30,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 03:26:30,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 03:26:30,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 03:26:30,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 03:26:31,335 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-11-29 03:26:31,335 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 572 574) the Hoare annotation is: true [2023-11-29 03:26:31,335 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 572 574) no Hoare annotation was computed. [2023-11-29 03:26:31,335 INFO L899 garLoopResultBuilder]: For program point L626(lines 626 628) no Hoare annotation was computed. [2023-11-29 03:26:31,335 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 591) no Hoare annotation was computed. [2023-11-29 03:26:31,335 INFO L899 garLoopResultBuilder]: For program point L589-1(lines 589 591) no Hoare annotation was computed. [2023-11-29 03:26:31,335 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 618 632) no Hoare annotation was computed. [2023-11-29 03:26:31,335 INFO L899 garLoopResultBuilder]: For program point L610-1(lines 610 613) no Hoare annotation was computed. [2023-11-29 03:26:31,336 INFO L895 garLoopResultBuilder]: At program point L610-3(lines 610 613) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse1 0)) (.cse0 (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_remove_last_~last~0#1.base|)) (.cse8 (= (select .cse2 0) 0)) (.cse9 (= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0)) (.cse10 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse11 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_remove_last_~last~0#1.base|))) (or (and .cse0 (<= 0 |ULTIMATE.start_main_~i~0#1|) (= (select .cse1 |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse2 |ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse3) (let ((.cse6 (+ |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 4))) (and (= |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 0) (= (select (select |#memory_$Pointer$#1.base| (select (select |#memory_$Pointer$#1.base| .cse4) 4)) 4) 0) .cse0 (= (select .cse5 .cse6) 0) (= .cse4 |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) .cse7 .cse8 (= (select (select |#memory_$Pointer$#1.offset| (select (select |#memory_$Pointer$#1.base| (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_dll_remove_last_~head#1.base|) 0)) 4)) 4) 0) .cse9 .cse10 .cse3 (= (select (select |#memory_$Pointer$#1.offset| .cse4) 4) 0) (= (select .cse11 .cse6) 0))) (let ((.cse12 (select .cse11 4))) (and (= .cse4 |ULTIMATE.start_dll_remove_last_~last~0#1.base|) .cse0 .cse7 (= (select .cse5 4) 0) .cse8 (not (= .cse12 0)) (= (select (select |#memory_$Pointer$#1.offset| .cse12) 4) 0) .cse9 .cse10 .cse3 (= |ULTIMATE.start_dll_remove_last_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$#1.base| .cse12) 4) 0)))))) [2023-11-29 03:26:31,336 INFO L899 garLoopResultBuilder]: For program point L610-4(lines 610 613) no Hoare annotation was computed. [2023-11-29 03:26:31,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2023-11-29 03:26:31,336 INFO L902 garLoopResultBuilder]: At program point L590(line 590) the Hoare annotation is: true [2023-11-29 03:26:31,336 INFO L895 garLoopResultBuilder]: At program point L623-3(lines 623 625) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse0 0)) (.cse1 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (= (select .cse1 0) 0)) (.cse3 (select (select |#memory_$Pointer$#1.base| .cse7) 4)) (.cse5 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= (select (select |#memory_$Pointer$#1.offset| .cse7) 4) 0))) (or (and (= (select .cse0 |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select .cse1 |ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse2) (and (= (select (select |#memory_$Pointer$#1.base| .cse3) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |ULTIMATE.start_main_~i~0#1| 1) .cse4 .cse5 .cse2 .cse6) (and .cse4 (= .cse3 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse5 .cse2 .cse6))))) [2023-11-29 03:26:31,336 INFO L899 garLoopResultBuilder]: For program point L623-4(lines 623 625) no Hoare annotation was computed. [2023-11-29 03:26:31,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 03:26:31,336 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 617) no Hoare annotation was computed. [2023-11-29 03:26:31,336 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2023-11-29 03:26:31,336 INFO L899 garLoopResultBuilder]: For program point L595-2(lines 595 597) no Hoare annotation was computed. [2023-11-29 03:26:31,336 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 03:26:31,336 INFO L895 garLoopResultBuilder]: At program point L587-2(lines 587 600) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse3 (= (select .cse5 4) 0)) (.cse4 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse0 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (or (and (= 2 |ULTIMATE.start_dll_create_~len#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (and .cse3 (= (select (select |#memory_$Pointer$#1.base| .cse4) 4) 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| .cse4)) .cse0 (<= |ULTIMATE.start_dll_create_~len#1| 0) (= (select (select |#memory_$Pointer$#1.offset| .cse4) 4) 0) .cse1 .cse2) (and .cse3 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select .cse5 8) 0) (= .cse4 0) .cse0 .cse1 (= |ULTIMATE.start_dll_create_~len#1| 1) .cse2)))) [2023-11-29 03:26:31,336 INFO L899 garLoopResultBuilder]: For program point L587-3(lines 587 600) no Hoare annotation was computed. [2023-11-29 03:26:31,336 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 616) no Hoare annotation was computed. [2023-11-29 03:26:31,337 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 618 632) no Hoare annotation was computed. [2023-11-29 03:26:31,339 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 03:26:31,340 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:26:31,350 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-11-29 03:26:31,351 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 03:26:31,351 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-29 03:26:31,351 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 03:26:31,351 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-11-29 03:26:31,351 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-29 03:26:31,352 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][8] could not be translated [2023-11-29 03:26:31,352 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-29 03:26:31,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated [2023-11-29 03:26:31,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-11-29 03:26:31,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-29 03:26:31,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-29 03:26:31,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-11-29 03:26:31,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 03:26:31,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-11-29 03:26:31,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 03:26:31,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 03:26:31,357 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 03:26:31,357 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-11-29 03:26:31,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-29 03:26:31,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated [2023-11-29 03:26:31,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 03:26:31,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-11-29 03:26:31,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-29 03:26:31,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-29 03:26:31,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 03:26:31,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-11-29 03:26:31,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~last~0!base][~last~0!offset + 4] could not be translated [2023-11-29 03:26:31,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-11-29 03:26:31,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-29 03:26:31,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-11-29 03:26:31,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~head!base][0]][4]][4] could not be translated [2023-11-29 03:26:31,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 03:26:31,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-29 03:26:31,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 03:26:31,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~last~0!base][~last~0!offset + 4] could not be translated [2023-11-29 03:26:31,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-11-29 03:26:31,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 03:26:31,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-11-29 03:26:31,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-29 03:26:31,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~last~0!base][4] could not be translated [2023-11-29 03:26:31,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-11-29 03:26:31,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~last~0!base][4] could not be translated [2023-11-29 03:26:31,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~last~0!base][4]][4] could not be translated [2023-11-29 03:26:31,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 03:26:31,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-29 03:26:31,362 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~last~0!base][4]][4] could not be translated [2023-11-29 03:26:31,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:26:31 BoogieIcfgContainer [2023-11-29 03:26:31,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:26:31,363 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:26:31,363 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:26:31,363 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:26:31,363 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:26:17" (3/4) ... [2023-11-29 03:26:31,365 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 03:26:31,368 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2023-11-29 03:26:31,373 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-11-29 03:26:31,373 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-29 03:26:31,373 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 03:26:31,374 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 03:26:31,465 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 03:26:31,466 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 03:26:31,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:26:31,467 INFO L158 Benchmark]: Toolchain (without parser) took 15029.92ms. Allocated memory was 165.7MB in the beginning and 352.3MB in the end (delta: 186.6MB). Free memory was 134.4MB in the beginning and 147.2MB in the end (delta: -12.8MB). Peak memory consumption was 172.6MB. Max. memory is 16.1GB. [2023-11-29 03:26:31,467 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 91.5MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:26:31,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.48ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 116.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 03:26:31,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.34ms. Allocated memory is still 165.7MB. Free memory was 116.4MB in the beginning and 114.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:26:31,469 INFO L158 Benchmark]: Boogie Preprocessor took 54.14ms. Allocated memory is still 165.7MB. Free memory was 114.3MB in the beginning and 111.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:26:31,469 INFO L158 Benchmark]: RCFGBuilder took 350.15ms. Allocated memory is still 165.7MB. Free memory was 111.5MB in the beginning and 127.1MB in the end (delta: -15.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 03:26:31,469 INFO L158 Benchmark]: TraceAbstraction took 14088.08ms. Allocated memory was 165.7MB in the beginning and 352.3MB in the end (delta: 186.6MB). Free memory was 126.1MB in the beginning and 152.5MB in the end (delta: -26.3MB). Peak memory consumption was 163.3MB. Max. memory is 16.1GB. [2023-11-29 03:26:31,470 INFO L158 Benchmark]: Witness Printer took 103.77ms. Allocated memory is still 352.3MB. Free memory was 152.5MB in the beginning and 147.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:26:31,471 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.18ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 91.5MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.48ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 116.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.34ms. Allocated memory is still 165.7MB. Free memory was 116.4MB in the beginning and 114.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.14ms. Allocated memory is still 165.7MB. Free memory was 114.3MB in the beginning and 111.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 350.15ms. Allocated memory is still 165.7MB. Free memory was 111.5MB in the beginning and 127.1MB in the end (delta: -15.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14088.08ms. Allocated memory was 165.7MB in the beginning and 352.3MB in the end (delta: 186.6MB). Free memory was 126.1MB in the beginning and 152.5MB in the end (delta: -26.3MB). Peak memory consumption was 163.3MB. Max. memory is 16.1GB. * Witness Printer took 103.77ms. Allocated memory is still 352.3MB. Free memory was 152.5MB in the beginning and 147.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][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 #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 #memory_$Pointer$#1.offset[~head~0!base][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][8] 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$#2.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~last~0!base][~last~0!offset + 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~head!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~last~0!base][~last~0!offset + 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~last~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~last~0!base][4]][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: 630]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 230 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 230 mSDsluCounter, 555 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 44 IncrementalHoareTripleChecker+Unchecked, 392 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 774 IncrementalHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 163 mSDtfsCounter, 774 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 231 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=10, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 21 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 19 NumberOfFragments, 414 HoareAnnotationTreeSize, 5 FomulaSimplifications, 195 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 682 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 404 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 483 ConstructedInterpolants, 8 QuantifiedInterpolants, 4728 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1617 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 276/339 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: 587]: Loop Invariant Derived loop invariant: ((((2 == len) && (len == 2)) || ((len <= 0) && (len == 2))) || ((len == 2) && (len == 1))) - InvariantResult [Line: 623]: Loop Invariant Derived loop invariant: (((len == 2) || ((i == 1) && (len == 2))) || ((0 <= i) && (len == 2))) - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-29 03:26:31,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05704b4-2b9d-41bd-8b37-12adf45a5910/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE