./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/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_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:18:41,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:18:41,171 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-29 00:18:41,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:18:41,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:18:41,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:18:41,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:18:41,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:18:41,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:18:41,205 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:18:41,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:18:41,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:18:41,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:18:41,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:18:41,208 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:18:41,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:18:41,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:18:41,210 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:18:41,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:18:41,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:18:41,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:18:41,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:18:41,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:18:41,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:18:41,223 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 00:18:41,224 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:18:41,224 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:18:41,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:18:41,225 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:18:41,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:18:41,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:18:41,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:18:41,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:18:41,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:18:41,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:18:41,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:18:41,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:18:41,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:18:41,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:18:41,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:18:41,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:18:41,229 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:18:41,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:18:41,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:18:41,229 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_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/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_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/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 ! overflow) ) 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 -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2023-11-29 00:18:41,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:18:41,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:18:41,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:18:41,467 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:18:41,467 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:18:41,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2023-11-29 00:18:44,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:18:44,357 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:18:44,357 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2023-11-29 00:18:44,366 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/data/fd8cf04a1/a93b00cbcc4c471baf9b786d7c3cc4a7/FLAG6f2319e97 [2023-11-29 00:18:44,723 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/data/fd8cf04a1/a93b00cbcc4c471baf9b786d7c3cc4a7 [2023-11-29 00:18:44,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:18:44,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:18:44,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:18:44,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:18:44,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:18:44,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:44,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12446dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44, skipping insertion in model container [2023-11-29 00:18:44,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:44,759 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:18:44,916 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:18:44,926 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:18:44,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:18:44,962 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:18:44,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44 WrapperNode [2023-11-29 00:18:44,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:18:44,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:18:44,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:18:44,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:18:44,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:44,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:45,000 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2023-11-29 00:18:45,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:18:45,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:18:45,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:18:45,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:18:45,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:45,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:45,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:45,033 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2023-11-29 00:18:45,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:45,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:45,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:45,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:45,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:45,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:45,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:18:45,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:18:45,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:18:45,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:18:45,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44" (1/1) ... [2023-11-29 00:18:45,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:18:45,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:18:45,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:18:45,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:18:45,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:18:45,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:18:45,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:18:45,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:18:45,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:18:45,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 00:18:45,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:18:45,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:18:45,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:18:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:18:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:18:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 00:18:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2023-11-29 00:18:45,121 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2023-11-29 00:18:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2023-11-29 00:18:45,121 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2023-11-29 00:18:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-29 00:18:45,121 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-29 00:18:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2023-11-29 00:18:45,122 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2023-11-29 00:18:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:18:45,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:18:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:18:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:18:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:18:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:18:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 00:18:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:18:45,228 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:18:45,230 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:18:45,456 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:18:45,484 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:18:45,484 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:18:45,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:18:45 BoogieIcfgContainer [2023-11-29 00:18:45,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:18:45,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:18:45,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:18:45,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:18:45,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:18:44" (1/3) ... [2023-11-29 00:18:45,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47302d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:18:45, skipping insertion in model container [2023-11-29 00:18:45,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:44" (2/3) ... [2023-11-29 00:18:45,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47302d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:18:45, skipping insertion in model container [2023-11-29 00:18:45,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:18:45" (3/3) ... [2023-11-29 00:18:45,493 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_4.c [2023-11-29 00:18:45,511 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:18:45,512 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-29 00:18:45,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:18:45,561 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;@4c5933d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:18:45,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-29 00:18:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.5) internal successors, (48), 44 states have internal predecessors, (48), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:18:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 00:18:45,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:18:45,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:18:45,571 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:18:45,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:45,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1456900990, now seen corresponding path program 1 times [2023-11-29 00:18:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:45,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989694177] [2023-11-29 00:18:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:45,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:46,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:46,050 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 00:18:46,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989694177] [2023-11-29 00:18:46,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989694177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:18:46,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:18:46,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:18:46,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836749123] [2023-11-29 00:18:46,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:46,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:18:46,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:46,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:18:46,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:18:46,089 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.5) internal successors, (48), 44 states have internal predecessors, (48), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:18:46,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:18:46,375 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2023-11-29 00:18:46,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:18:46,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-29 00:18:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:18:46,386 INFO L225 Difference]: With dead ends: 81 [2023-11-29 00:18:46,386 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 00:18:46,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:18:46,392 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 40 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:18:46,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 189 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:18:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 00:18:46,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2023-11-29 00:18:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 38 states have internal predecessors, (39), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 00:18:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2023-11-29 00:18:46,461 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 11 [2023-11-29 00:18:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:18:46,461 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2023-11-29 00:18:46,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:18:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2023-11-29 00:18:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 00:18:46,463 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:18:46,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:18:46,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:18:46,464 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:18:46,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:46,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1916990516, now seen corresponding path program 1 times [2023-11-29 00:18:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:46,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285806370] [2023-11-29 00:18:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:46,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:46,680 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 00:18:46,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:46,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285806370] [2023-11-29 00:18:46,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285806370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:18:46,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:18:46,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:18:46,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113036755] [2023-11-29 00:18:46,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:46,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:18:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:46,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:18:46,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:18:46,684 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:18:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:18:46,753 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2023-11-29 00:18:46,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:18:46,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 00:18:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:18:46,755 INFO L225 Difference]: With dead ends: 96 [2023-11-29 00:18:46,755 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 00:18:46,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:18:46,758 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:18:46,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 201 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:18:46,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 00:18:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2023-11-29 00:18:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 40 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 00:18:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2023-11-29 00:18:46,768 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 14 [2023-11-29 00:18:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:18:46,768 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2023-11-29 00:18:46,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:18:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2023-11-29 00:18:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:18:46,770 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:18:46,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:18:46,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:18:46,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_25_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:18:46,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash 702836230, now seen corresponding path program 1 times [2023-11-29 00:18:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:46,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138185720] [2023-11-29 00:18:46,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:46,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:46,842 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 00:18:46,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:46,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138185720] [2023-11-29 00:18:46,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138185720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:18:46,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:18:46,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:18:46,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427389971] [2023-11-29 00:18:46,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:46,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:18:46,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:46,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:18:46,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:18:46,845 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:18:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:18:46,869 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2023-11-29 00:18:46,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:18:46,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 00:18:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:18:46,871 INFO L225 Difference]: With dead ends: 51 [2023-11-29 00:18:46,871 INFO L226 Difference]: Without dead ends: 50 [2023-11-29 00:18:46,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:18:46,873 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:18:46,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:18:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-29 00:18:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-29 00:18:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 00:18:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-11-29 00:18:46,882 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 15 [2023-11-29 00:18:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:18:46,883 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-11-29 00:18:46,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:18:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-11-29 00:18:46,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 00:18:46,884 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:18:46,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:18:46,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:18:46,884 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:18:46,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1911039939, now seen corresponding path program 1 times [2023-11-29 00:18:46,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:46,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356685591] [2023-11-29 00:18:46,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:46,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:47,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:18:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:47,053 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 00:18:47,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:47,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356685591] [2023-11-29 00:18:47,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356685591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:18:47,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:18:47,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:18:47,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404608791] [2023-11-29 00:18:47,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:47,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:18:47,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:47,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:18:47,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:18:47,057 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:18:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:18:47,207 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2023-11-29 00:18:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:18:47,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-29 00:18:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:18:47,209 INFO L225 Difference]: With dead ends: 110 [2023-11-29 00:18:47,209 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 00:18:47,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:18:47,212 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:18:47,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 122 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:18:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 00:18:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2023-11-29 00:18:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.303030303030303) internal successors, (43), 41 states have internal predecessors, (43), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-29 00:18:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2023-11-29 00:18:47,223 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 14 [2023-11-29 00:18:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:18:47,224 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2023-11-29 00:18:47,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:18:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2023-11-29 00:18:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 00:18:47,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:18:47,225 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:18:47,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:18:47,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:18:47,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:47,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1500420822, now seen corresponding path program 1 times [2023-11-29 00:18:47,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:47,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866119365] [2023-11-29 00:18:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:47,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:18:47,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866119365] [2023-11-29 00:18:47,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866119365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:18:47,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:18:47,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:18:47,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539986746] [2023-11-29 00:18:47,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:47,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:18:47,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:47,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:18:47,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:18:47,467 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:18:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:18:47,555 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2023-11-29 00:18:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:18:47,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 00:18:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:18:47,557 INFO L225 Difference]: With dead ends: 58 [2023-11-29 00:18:47,557 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 00:18:47,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:18:47,559 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:18:47,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:18:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 00:18:47,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2023-11-29 00:18:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.28125) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-29 00:18:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2023-11-29 00:18:47,569 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 19 [2023-11-29 00:18:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:18:47,569 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2023-11-29 00:18:47,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:18:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2023-11-29 00:18:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 00:18:47,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:18:47,571 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 00:18:47,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:18:47,572 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:18:47,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1981663163, now seen corresponding path program 1 times [2023-11-29 00:18:47,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:47,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154507137] [2023-11-29 00:18:47,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:47,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:47,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 00:18:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:18:47,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:47,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154507137] [2023-11-29 00:18:47,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154507137] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:18:47,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080136633] [2023-11-29 00:18:47,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:47,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:47,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:18:47,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:18:47,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:18:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:47,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:18:47,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:18:47,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:18:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:18:47,952 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:18:47,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080136633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:18:47,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:18:47,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2023-11-29 00:18:47,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531160596] [2023-11-29 00:18:47,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:47,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:18:47,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:47,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:18:47,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:18:47,954 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:18:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:18:48,081 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2023-11-29 00:18:48,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:18:48,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-11-29 00:18:48,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:18:48,083 INFO L225 Difference]: With dead ends: 101 [2023-11-29 00:18:48,083 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 00:18:48,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:18:48,085 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:18:48,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 44 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:18:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 00:18:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-29 00:18:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 40 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-29 00:18:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2023-11-29 00:18:48,094 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 22 [2023-11-29 00:18:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:18:48,094 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2023-11-29 00:18:48,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:18:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2023-11-29 00:18:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 00:18:48,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:18:48,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:18:48,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:18:48,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:48,297 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:18:48,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:48,297 INFO L85 PathProgramCache]: Analyzing trace with hash -214899351, now seen corresponding path program 1 times [2023-11-29 00:18:48,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:48,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580615358] [2023-11-29 00:18:48,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:48,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:48,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:18:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:48,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:18:48,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:48,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580615358] [2023-11-29 00:18:48,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580615358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:18:48,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:18:48,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:18:48,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321390999] [2023-11-29 00:18:48,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:48,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:18:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:18:48,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:18:48,449 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:18:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:18:48,584 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2023-11-29 00:18:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:18:48,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-11-29 00:18:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:18:48,586 INFO L225 Difference]: With dead ends: 64 [2023-11-29 00:18:48,586 INFO L226 Difference]: Without dead ends: 60 [2023-11-29 00:18:48,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:18:48,587 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:18:48,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 188 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:18:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-29 00:18:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-29 00:18:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.236842105263158) internal successors, (47), 44 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-29 00:18:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2023-11-29 00:18:48,596 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 24 [2023-11-29 00:18:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:18:48,596 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2023-11-29 00:18:48,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:18:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2023-11-29 00:18:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 00:18:48,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:18:48,598 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:18:48,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:18:48,598 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:18:48,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:48,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1315383449, now seen corresponding path program 1 times [2023-11-29 00:18:48,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:48,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374833711] [2023-11-29 00:18:48,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:48,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:48,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:18:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:18:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:48,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 00:18:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:48,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 00:18:48,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:48,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374833711] [2023-11-29 00:18:48,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374833711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:18:48,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:18:48,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:18:48,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020692956] [2023-11-29 00:18:48,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:48,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:18:48,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:48,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:18:48,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:18:48,772 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 8 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:18:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:18:48,957 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2023-11-29 00:18:48,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:18:48,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2023-11-29 00:18:48,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:18:48,959 INFO L225 Difference]: With dead ends: 70 [2023-11-29 00:18:48,959 INFO L226 Difference]: Without dead ends: 66 [2023-11-29 00:18:48,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:18:48,960 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 45 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:18:48,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 159 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:18:48,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-29 00:18:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-11-29 00:18:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 48 states have internal predecessors, (52), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 00:18:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2023-11-29 00:18:48,970 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 34 [2023-11-29 00:18:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:18:48,971 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2023-11-29 00:18:48,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:18:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2023-11-29 00:18:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 00:18:48,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:18:48,973 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:18:48,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:18:48,973 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:18:48,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2089760975, now seen corresponding path program 1 times [2023-11-29 00:18:48,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:48,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157265947] [2023-11-29 00:18:48,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:48,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:49,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:18:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:49,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:49,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:18:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:49,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 00:18:49,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:49,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157265947] [2023-11-29 00:18:49,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157265947] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:18:49,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063112985] [2023-11-29 00:18:49,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:49,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:49,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:18:49,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:18:49,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:18:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:49,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 00:18:49,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:18:49,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:18:49,648 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 17 treesize of output 9 [2023-11-29 00:18:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 00:18:49,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:18:49,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063112985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:18:49,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:18:49,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2023-11-29 00:18:49,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588391943] [2023-11-29 00:18:49,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:49,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:18:49,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:49,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:18:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:18:49,669 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:18:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:18:49,814 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2023-11-29 00:18:49,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:18:49,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2023-11-29 00:18:49,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:18:49,816 INFO L225 Difference]: With dead ends: 69 [2023-11-29 00:18:49,816 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 00:18:49,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:18:49,818 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 47 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:18:49,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 128 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:18:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 00:18:49,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2023-11-29 00:18:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.186046511627907) internal successors, (51), 47 states have internal predecessors, (51), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 00:18:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2023-11-29 00:18:49,831 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 42 [2023-11-29 00:18:49,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:18:49,831 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2023-11-29 00:18:49,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:18:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2023-11-29 00:18:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 00:18:49,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:18:49,833 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:18:49,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:18:50,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:50,036 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:18:50,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:50,036 INFO L85 PathProgramCache]: Analyzing trace with hash -358080746, now seen corresponding path program 1 times [2023-11-29 00:18:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:50,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814686797] [2023-11-29 00:18:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:50,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:18:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:18:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 00:18:50,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:50,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814686797] [2023-11-29 00:18:50,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814686797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:18:50,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:18:50,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:18:50,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055535168] [2023-11-29 00:18:50,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:50,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:18:50,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:50,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:18:50,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:18:50,121 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 00:18:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:18:50,193 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2023-11-29 00:18:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:18:50,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2023-11-29 00:18:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:18:50,195 INFO L225 Difference]: With dead ends: 65 [2023-11-29 00:18:50,195 INFO L226 Difference]: Without dead ends: 64 [2023-11-29 00:18:50,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:18:50,196 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 16 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:18:50,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 146 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:18:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-29 00:18:50,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2023-11-29 00:18:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-29 00:18:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2023-11-29 00:18:50,207 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 43 [2023-11-29 00:18:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:18:50,207 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2023-11-29 00:18:50,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 00:18:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2023-11-29 00:18:50,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 00:18:50,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:18:50,210 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:18:50,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:18:50,210 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:18:50,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:50,210 INFO L85 PathProgramCache]: Analyzing trace with hash -44567208, now seen corresponding path program 1 times [2023-11-29 00:18:50,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:50,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751025689] [2023-11-29 00:18:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:50,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:18:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:18:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 00:18:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:18:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:18:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 00:18:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-29 00:18:50,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:50,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751025689] [2023-11-29 00:18:50,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751025689] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:18:50,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376495764] [2023-11-29 00:18:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:50,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:50,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:18:50,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:18:50,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:18:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:50,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 00:18:50,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:18:50,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:18:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-29 00:18:51,107 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:18:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 00:18:51,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376495764] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:18:51,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:18:51,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 26 [2023-11-29 00:18:51,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519749149] [2023-11-29 00:18:51,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:18:51,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 00:18:51,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:51,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 00:18:51,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2023-11-29 00:18:51,751 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 26 states, 20 states have (on average 3.25) internal successors, (65), 22 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (17), 5 states have call predecessors, (17), 8 states have call successors, (17) [2023-11-29 00:18:52,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:18:52,156 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2023-11-29 00:18:52,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:18:52,156 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 3.25) internal successors, (65), 22 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (17), 5 states have call predecessors, (17), 8 states have call successors, (17) Word has length 65 [2023-11-29 00:18:52,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:18:52,157 INFO L225 Difference]: With dead ends: 119 [2023-11-29 00:18:52,157 INFO L226 Difference]: Without dead ends: 64 [2023-11-29 00:18:52,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 00:18:52,160 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:18:52,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 376 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:18:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-29 00:18:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-29 00:18:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 45 states have internal predecessors, (49), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2023-11-29 00:18:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2023-11-29 00:18:52,170 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 65 [2023-11-29 00:18:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:18:52,170 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2023-11-29 00:18:52,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 3.25) internal successors, (65), 22 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (17), 5 states have call predecessors, (17), 8 states have call successors, (17) [2023-11-29 00:18:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2023-11-29 00:18:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-29 00:18:52,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:18:52,172 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:18:52,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:18:52,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:52,376 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:18:52,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:52,377 INFO L85 PathProgramCache]: Analyzing trace with hash -423874344, now seen corresponding path program 2 times [2023-11-29 00:18:52,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:52,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085103554] [2023-11-29 00:18:52,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:52,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:52,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:18:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:52,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:18:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:53,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:53,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:53,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:53,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 00:18:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:53,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:18:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:53,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:18:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:53,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:53,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:53,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:53,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 00:18:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 13 proven. 99 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-29 00:18:53,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:53,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085103554] [2023-11-29 00:18:53,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085103554] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:18:53,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679223397] [2023-11-29 00:18:53,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:18:53,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:53,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:18:53,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:18:53,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:18:53,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:18:53,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:18:53,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 00:18:53,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:18:53,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:18:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 00:18:54,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:18:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 5 proven. 133 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-29 00:18:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679223397] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:18:56,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:18:56,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 21] total 42 [2023-11-29 00:18:56,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40881134] [2023-11-29 00:18:56,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:18:56,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-29 00:18:56,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:56,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-29 00:18:56,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 00:18:56,232 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 42 states, 32 states have (on average 2.5625) internal successors, (82), 36 states have internal predecessors, (82), 12 states have call successors, (28), 8 states have call predecessors, (28), 11 states have return successors, (23), 9 states have call predecessors, (23), 12 states have call successors, (23) [2023-11-29 00:18:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:18:56,800 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2023-11-29 00:18:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:18:56,800 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 2.5625) internal successors, (82), 36 states have internal predecessors, (82), 12 states have call successors, (28), 8 states have call predecessors, (28), 11 states have return successors, (23), 9 states have call predecessors, (23), 12 states have call successors, (23) Word has length 93 [2023-11-29 00:18:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:18:56,801 INFO L225 Difference]: With dead ends: 127 [2023-11-29 00:18:56,802 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 00:18:56,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 180 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=451, Invalid=2201, Unknown=0, NotChecked=0, Total=2652 [2023-11-29 00:18:56,804 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 32 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:18:56,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 552 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:18:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 00:18:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-29 00:18:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 47 states have internal predecessors, (51), 10 states have call successors, (10), 8 states have call predecessors, (10), 10 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2023-11-29 00:18:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2023-11-29 00:18:56,813 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 93 [2023-11-29 00:18:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:18:56,813 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2023-11-29 00:18:56,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 2.5625) internal successors, (82), 36 states have internal predecessors, (82), 12 states have call successors, (28), 8 states have call predecessors, (28), 11 states have return successors, (23), 9 states have call predecessors, (23), 12 states have call successors, (23) [2023-11-29 00:18:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2023-11-29 00:18:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 00:18:56,815 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:18:56,816 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 10, 10, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:18:56,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 00:18:57,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 00:18:57,020 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:18:57,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash -278343336, now seen corresponding path program 3 times [2023-11-29 00:18:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:57,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114129834] [2023-11-29 00:18:57,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:57,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:57,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:18:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:57,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:18:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:57,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:18:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 00:18:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:18:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:18:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:18:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 21 proven. 227 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2023-11-29 00:18:58,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:58,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114129834] [2023-11-29 00:18:58,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114129834] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:18:58,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72191932] [2023-11-29 00:18:58,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:18:58,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:58,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:18:58,521 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:18:58,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:18:58,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 00:18:58,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:18:58,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 00:18:58,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:18:58,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:18:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2023-11-29 00:18:58,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:18:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2023-11-29 00:18:59,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72191932] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:18:59,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:18:59,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 11] total 36 [2023-11-29 00:18:59,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390605356] [2023-11-29 00:18:59,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:18:59,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 00:18:59,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:59,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 00:18:59,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 00:18:59,411 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 36 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 31 states have internal predecessors, (71), 12 states have call successors, (23), 7 states have call predecessors, (23), 12 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2023-11-29 00:18:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:18:59,999 INFO L93 Difference]: Finished difference Result 135 states and 159 transitions. [2023-11-29 00:19:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 00:19:00,000 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 31 states have internal predecessors, (71), 12 states have call successors, (23), 7 states have call predecessors, (23), 12 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) Word has length 121 [2023-11-29 00:19:00,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:19:00,001 INFO L225 Difference]: With dead ends: 135 [2023-11-29 00:19:00,001 INFO L226 Difference]: Without dead ends: 72 [2023-11-29 00:19:00,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=2131, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 00:19:00,003 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 52 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:19:00,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 351 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:19:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-29 00:19:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-29 00:19:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 10 states have call successors, (10), 8 states have call predecessors, (10), 12 states have return successors, (17), 14 states have call predecessors, (17), 8 states have call successors, (17) [2023-11-29 00:19:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2023-11-29 00:19:00,012 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 121 [2023-11-29 00:19:00,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:19:00,013 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2023-11-29 00:19:00,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 31 states have internal predecessors, (71), 12 states have call successors, (23), 7 states have call predecessors, (23), 12 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2023-11-29 00:19:00,013 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2023-11-29 00:19:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-11-29 00:19:00,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:19:00,016 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 24, 24, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:19:00,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 00:19:00,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:19:00,222 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:19:00,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:19:00,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1630645784, now seen corresponding path program 4 times [2023-11-29 00:19:00,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:19:00,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055822871] [2023-11-29 00:19:00,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:19:00,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:19:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:19:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 00:19:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:00,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:01,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:01,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:01,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:01,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:01,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:01,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:01,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:01,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2430 trivial. 0 not checked. [2023-11-29 00:19:01,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:19:01,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055822871] [2023-11-29 00:19:01,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055822871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:19:01,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839285839] [2023-11-29 00:19:01,074 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:19:01,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:19:01,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:19:01,075 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:19:01,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:19:01,351 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:19:01,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:19:01,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 00:19:01,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:19:01,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:19:01,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 00:19:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 1276 proven. 1 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2023-11-29 00:19:01,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:19:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2430 trivial. 0 not checked. [2023-11-29 00:19:02,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839285839] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 00:19:02,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:19:02,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 11] total 24 [2023-11-29 00:19:02,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167517599] [2023-11-29 00:19:02,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:19:02,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:19:02,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:19:02,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:19:02,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2023-11-29 00:19:02,163 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 00:19:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:19:02,238 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2023-11-29 00:19:02,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:19:02,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 245 [2023-11-29 00:19:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:19:02,241 INFO L225 Difference]: With dead ends: 75 [2023-11-29 00:19:02,241 INFO L226 Difference]: Without dead ends: 74 [2023-11-29 00:19:02,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 543 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2023-11-29 00:19:02,242 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 15 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:19:02,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:19:02,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-29 00:19:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2023-11-29 00:19:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 48 states have internal predecessors, (52), 10 states have call successors, (10), 8 states have call predecessors, (10), 12 states have return successors, (17), 14 states have call predecessors, (17), 8 states have call successors, (17) [2023-11-29 00:19:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2023-11-29 00:19:02,251 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 245 [2023-11-29 00:19:02,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:19:02,251 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2023-11-29 00:19:02,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 00:19:02,252 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2023-11-29 00:19:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-11-29 00:19:02,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:19:02,255 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 24, 24, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:19:02,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:19:02,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:19:02,456 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:19:02,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:19:02,456 INFO L85 PathProgramCache]: Analyzing trace with hash -989588194, now seen corresponding path program 1 times [2023-11-29 00:19:02,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:19:02,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505028807] [2023-11-29 00:19:02,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:19:02,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:19:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:02,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:19:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:02,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:02,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:02,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 00:19:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2436 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2430 trivial. 0 not checked. [2023-11-29 00:19:03,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:19:03,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505028807] [2023-11-29 00:19:03,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505028807] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:19:03,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430259460] [2023-11-29 00:19:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:19:03,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:19:03,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:19:03,218 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:19:03,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:19:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:03,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:19:03,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:19:03,815 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 15 treesize of output 7 [2023-11-29 00:19:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2436 backedges. 1277 proven. 0 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2023-11-29 00:19:03,831 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:19:03,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430259460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:19:03,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:19:03,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-11-29 00:19:03,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856361967] [2023-11-29 00:19:03,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:19:03,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:19:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:19:03,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:19:03,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:19:03,833 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 00:19:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:19:03,909 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2023-11-29 00:19:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:19:03,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 246 [2023-11-29 00:19:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:19:03,911 INFO L225 Difference]: With dead ends: 71 [2023-11-29 00:19:03,911 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 00:19:03,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:19:03,912 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:19:03,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:19:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 00:19:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2023-11-29 00:19:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 9 states have call successors, (9), 8 states have call predecessors, (9), 12 states have return successors, (16), 13 states have call predecessors, (16), 7 states have call successors, (16) [2023-11-29 00:19:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2023-11-29 00:19:03,921 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 246 [2023-11-29 00:19:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:19:03,922 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2023-11-29 00:19:03,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 00:19:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2023-11-29 00:19:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2023-11-29 00:19:03,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:19:03,926 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 24, 24, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 00:19:03,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 00:19:04,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 00:19:04,127 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:19:04,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:19:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1912715789, now seen corresponding path program 1 times [2023-11-29 00:19:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:19:04,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100976465] [2023-11-29 00:19:04,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:19:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:19:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:04,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:04,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 00:19:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 00:19:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 00:19:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 11 proven. 64 refuted. 0 times theorem prover too weak. 2389 trivial. 0 not checked. [2023-11-29 00:19:05,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:19:05,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100976465] [2023-11-29 00:19:05,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100976465] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:19:05,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077183915] [2023-11-29 00:19:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:19:05,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:19:05,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:19:05,895 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:19:05,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 00:19:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:06,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-29 00:19:06,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:19:06,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:19:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 1282 proven. 8 refuted. 0 times theorem prover too weak. 1174 trivial. 0 not checked. [2023-11-29 00:19:06,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:19:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 5 proven. 82 refuted. 0 times theorem prover too weak. 2377 trivial. 0 not checked. [2023-11-29 00:19:07,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077183915] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:19:07,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:19:07,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 16] total 38 [2023-11-29 00:19:07,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801059952] [2023-11-29 00:19:07,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:19:07,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 00:19:07,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:19:07,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 00:19:07,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 00:19:07,733 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 38 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 31 states have internal predecessors, (92), 15 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (28), 11 states have call predecessors, (28), 15 states have call successors, (28) [2023-11-29 00:19:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:19:08,202 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2023-11-29 00:19:08,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:19:08,204 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 31 states have internal predecessors, (92), 15 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (28), 11 states have call predecessors, (28), 15 states have call successors, (28) Word has length 268 [2023-11-29 00:19:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:19:08,205 INFO L225 Difference]: With dead ends: 131 [2023-11-29 00:19:08,205 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 00:19:08,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 586 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2023-11-29 00:19:08,208 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 76 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:19:08,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 251 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:19:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 00:19:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-11-29 00:19:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 9 states have call successors, (9), 8 states have call predecessors, (9), 14 states have return successors, (18), 15 states have call predecessors, (18), 7 states have call successors, (18) [2023-11-29 00:19:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2023-11-29 00:19:08,217 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 268 [2023-11-29 00:19:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:19:08,218 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2023-11-29 00:19:08,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 31 states have internal predecessors, (92), 15 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (28), 11 states have call predecessors, (28), 15 states have call successors, (28) [2023-11-29 00:19:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2023-11-29 00:19:08,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2023-11-29 00:19:08,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:19:08,229 INFO L195 NwaCegarLoop]: trace histogram [56, 56, 48, 48, 48, 48, 48, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 00:19:08,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 00:19:08,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 00:19:08,429 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:19:08,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:19:08,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1781243683, now seen corresponding path program 2 times [2023-11-29 00:19:08,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:19:08,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511308469] [2023-11-29 00:19:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:19:08,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:19:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:09,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:10,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:11,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:11,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:11,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:11,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:11,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:11,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:11,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:11,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 00:19:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-11-29 00:19:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 00:19:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9898 backedges. 5 proven. 188 refuted. 0 times theorem prover too weak. 9705 trivial. 0 not checked. [2023-11-29 00:19:13,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:19:13,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511308469] [2023-11-29 00:19:13,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511308469] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:19:13,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150509653] [2023-11-29 00:19:13,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:19:13,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:19:13,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:19:13,286 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:19:13,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 00:19:13,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:19:13,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:19:13,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 1914 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 00:19:13,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:19:13,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:19:14,305 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 17 treesize of output 9 [2023-11-29 00:19:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9898 backedges. 5070 proven. 0 refuted. 0 times theorem prover too weak. 4828 trivial. 0 not checked. [2023-11-29 00:19:14,335 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:19:14,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150509653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:19:14,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:19:14,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 22 [2023-11-29 00:19:14,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486942220] [2023-11-29 00:19:14,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:19:14,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:19:14,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:19:14,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:19:14,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2023-11-29 00:19:14,338 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 00:19:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:19:14,457 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2023-11-29 00:19:14,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:19:14,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 488 [2023-11-29 00:19:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:19:14,460 INFO L225 Difference]: With dead ends: 71 [2023-11-29 00:19:14,461 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 00:19:14,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 630 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2023-11-29 00:19:14,462 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:19:14,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 120 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:19:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 00:19:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2023-11-29 00:19:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 9 states have call successors, (9), 8 states have call predecessors, (9), 14 states have return successors, (18), 15 states have call predecessors, (18), 7 states have call successors, (18) [2023-11-29 00:19:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2023-11-29 00:19:14,473 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 488 [2023-11-29 00:19:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:19:14,475 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2023-11-29 00:19:14,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 00:19:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2023-11-29 00:19:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2023-11-29 00:19:14,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:19:14,480 INFO L195 NwaCegarLoop]: trace histogram [56, 56, 48, 48, 48, 48, 48, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 00:19:14,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 00:19:14,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 00:19:14,681 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2023-11-29 00:19:14,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:19:14,681 INFO L85 PathProgramCache]: Analyzing trace with hash 616020744, now seen corresponding path program 1 times [2023-11-29 00:19:14,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:19:14,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573049333] [2023-11-29 00:19:14,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:19:14,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:19:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:17,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 00:19:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-11-29 00:19:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:19:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:19:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:19:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 00:19:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9899 backedges. 5 proven. 188 refuted. 0 times theorem prover too weak. 9706 trivial. 0 not checked. [2023-11-29 00:19:18,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:19:18,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573049333] [2023-11-29 00:19:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573049333] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:19:18,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744509189] [2023-11-29 00:19:18,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:19:18,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:19:18,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:19:18,563 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:19:18,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 00:19:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:19,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:19:19,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:19:19,514 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 15 treesize of output 7 [2023-11-29 00:19:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9899 backedges. 5070 proven. 0 refuted. 0 times theorem prover too weak. 4829 trivial. 0 not checked. [2023-11-29 00:19:19,536 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:19:19,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744509189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:19:19,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:19:19,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2023-11-29 00:19:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192302099] [2023-11-29 00:19:19,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:19:19,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:19:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:19:19,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:19:19,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2023-11-29 00:19:19,538 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 00:19:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:19:19,614 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2023-11-29 00:19:19,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:19:19,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 489 [2023-11-29 00:19:19,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:19:19,616 INFO L225 Difference]: With dead ends: 69 [2023-11-29 00:19:19,616 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:19:19,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 630 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2023-11-29 00:19:19,617 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:19:19,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 108 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:19:19,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:19:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:19:19,618 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 00:19:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:19:19,618 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 489 [2023-11-29 00:19:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:19:19,618 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:19:19,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 00:19:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:19:19,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:19:19,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-29 00:19:19,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-29 00:19:19,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-29 00:19:19,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-29 00:19:19,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-29 00:19:19,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-29 00:19:19,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-29 00:19:19,622 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-29 00:19:19,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 00:19:19,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 00:19:19,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 00:19:51,981 WARN L293 SmtUtils]: Spent 32.14s on a formula simplification. DAG size of input: 70 DAG size of output: 58 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 00:20:00,793 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 76 DAG size of output: 53 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 00:20:00,856 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (or (< (+ 2147483648 (select (select |old(#memory_int#2)| |func_to_recursive_line_24_to_25_0_#in~c.base|) |func_to_recursive_line_24_to_25_0_#in~c.offset|)) 0) (let ((.cse0 (select (select |#memory_int#2| func_to_recursive_line_24_to_25_0_~c.base) func_to_recursive_line_24_to_25_0_~c.offset)) (.cse1 (select |old(#memory_int#2)| func_to_recursive_line_24_to_25_0_~c.base))) (and (= func_to_recursive_line_24_to_25_0_~c.offset |func_to_recursive_line_24_to_25_0_#in~c.offset|) (= func_to_recursive_line_24_to_25_0_~d.offset |func_to_recursive_line_24_to_25_0_#in~d.offset|) (<= 0 (+ .cse0 2147483648)) (= |#memory_int#2| (store |old(#memory_int#2)| func_to_recursive_line_24_to_25_0_~c.base (store .cse1 func_to_recursive_line_24_to_25_0_~c.offset .cse0))) (= func_to_recursive_line_24_to_25_0_~c.base |func_to_recursive_line_24_to_25_0_#in~c.base|) (<= .cse0 (+ (select .cse1 func_to_recursive_line_24_to_25_0_~c.offset) 1)))) (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2) 2147483648) 0)) (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3))) (forall ((v_func_to_recursive_line_23_to_24_0_~b.base_BEFORE_CALL_4 Int) (v_func_to_recursive_line_23_to_24_0_~b.offset_BEFORE_CALL_5 Int)) (< 5 (select (select |#memory_int#4| v_func_to_recursive_line_23_to_24_0_~b.base_BEFORE_CALL_4) v_func_to_recursive_line_23_to_24_0_~b.offset_BEFORE_CALL_5)))) [2023-11-29 00:20:00,856 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_24_to_25_0EXIT(lines 39 57) no Hoare annotation was computed. [2023-11-29 00:20:00,856 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-29 00:20:00,856 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 50) no Hoare annotation was computed. [2023-11-29 00:20:00,856 INFO L899 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2023-11-29 00:20:00,857 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (or (< (+ 2147483648 (select (select |old(#memory_int#2)| |func_to_recursive_line_24_to_25_0_#in~c.base|) |func_to_recursive_line_24_to_25_0_#in~c.offset|)) 0) (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2) 2147483648) 0)) (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3))) (forall ((v_func_to_recursive_line_23_to_24_0_~b.base_BEFORE_CALL_4 Int) (v_func_to_recursive_line_23_to_24_0_~b.offset_BEFORE_CALL_5 Int)) (< 5 (select (select |#memory_int#4| v_func_to_recursive_line_23_to_24_0_~b.base_BEFORE_CALL_4) v_func_to_recursive_line_23_to_24_0_~b.offset_BEFORE_CALL_5))) (let ((.cse1 (select (select |#memory_int#1| |func_to_recursive_line_25_to_25_0_#in~d.base|) |func_to_recursive_line_25_to_25_0_#in~d.offset|)) (.cse0 (select (select |old(#memory_int#1)| |func_to_recursive_line_25_to_25_0_#in~d.base|) |func_to_recursive_line_25_to_25_0_#in~d.offset|))) (and (or (< 5 .cse0) (< .cse1 6)) (= func_to_recursive_line_24_to_25_0_~c.offset |func_to_recursive_line_24_to_25_0_#in~c.offset|) (or (< .cse1 3) (< 2 .cse0)) (= |#memory_int#2| |old(#memory_int#2)|) (= func_to_recursive_line_24_to_25_0_~d.offset |func_to_recursive_line_24_to_25_0_#in~d.offset|) (<= (select (select |#memory_int#2| func_to_recursive_line_24_to_25_0_~c.base) func_to_recursive_line_24_to_25_0_~c.offset) 5) (= func_to_recursive_line_24_to_25_0_~c.base |func_to_recursive_line_24_to_25_0_#in~c.base|) (or (< .cse1 4) (< 3 .cse0)) (= (select (select |#memory_int#1| func_to_recursive_line_24_to_25_0_~d.base) func_to_recursive_line_24_to_25_0_~d.offset) 0) (or (< .cse1 5) (< 4 .cse0))))) [2023-11-29 00:20:00,857 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2023-11-29 00:20:00,857 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 50) no Hoare annotation was computed. [2023-11-29 00:20:00,857 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 39 57) the Hoare annotation is: (or (and (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|)) (< (+ 2147483648 (select (select |old(#memory_int#2)| |func_to_recursive_line_24_to_25_0_#in~c.base|) |func_to_recursive_line_24_to_25_0_#in~c.offset|)) 0) (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2) 2147483648) 0)) (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3))) (forall ((v_func_to_recursive_line_23_to_24_0_~b.base_BEFORE_CALL_4 Int) (v_func_to_recursive_line_23_to_24_0_~b.offset_BEFORE_CALL_5 Int)) (< 5 (select (select |#memory_int#4| v_func_to_recursive_line_23_to_24_0_~b.base_BEFORE_CALL_4) v_func_to_recursive_line_23_to_24_0_~b.offset_BEFORE_CALL_5)))) [2023-11-29 00:20:00,857 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 56) no Hoare annotation was computed. [2023-11-29 00:20:00,857 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 39 57) no Hoare annotation was computed. [2023-11-29 00:20:00,858 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 76) no Hoare annotation was computed. [2023-11-29 00:20:00,858 INFO L899 garLoopResultBuilder]: For program point L61-1(lines 59 77) no Hoare annotation was computed. [2023-11-29 00:20:00,858 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_23_to_24_0EXIT(lines 59 77) no Hoare annotation was computed. [2023-11-29 00:20:00,858 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-11-29 00:20:00,858 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-11-29 00:20:00,858 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 59 77) the Hoare annotation is: (or (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2) 2147483648) 0)) (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3))) (forall ((v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |old(#memory_int#2)| v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2) 2147483648) 0)) (<= (+ 2147483650 (select (select |old(#memory_int#4)| |func_to_recursive_line_23_to_24_0_#in~b.base|) |func_to_recursive_line_23_to_24_0_#in~b.offset|)) 0) (and (= |#memory_int#4| |old(#memory_int#4)|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|))) [2023-11-29 00:20:00,858 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (or (and (<= 0 (+ 2147483649 (select (select |#memory_int#4| func_to_recursive_line_23_to_24_0_~b.base) func_to_recursive_line_23_to_24_0_~b.offset))) (exists ((v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#2| v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2) 2147483648)))) (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2) 2147483648) 0)) (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3))) (forall ((v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |old(#memory_int#2)| v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2) 2147483648) 0)) (<= (+ 2147483650 (select (select |old(#memory_int#4)| |func_to_recursive_line_23_to_24_0_#in~b.base|) |func_to_recursive_line_23_to_24_0_#in~b.offset|)) 0)) [2023-11-29 00:20:00,859 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-29 00:20:00,859 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-11-29 00:20:00,859 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (or (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2) 2147483648) 0)) (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3))) (forall ((v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |old(#memory_int#2)| v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2) 2147483648) 0)) (<= (+ 2147483650 (select (select |old(#memory_int#4)| |func_to_recursive_line_23_to_24_0_#in~b.base|) |func_to_recursive_line_23_to_24_0_#in~b.offset|)) 0) (let ((.cse0 (select (select |#memory_int#4| func_to_recursive_line_23_to_24_0_~b.base) func_to_recursive_line_23_to_24_0_~b.offset)) (.cse1 (select (select |old(#memory_int#2)| |func_to_recursive_line_24_to_25_0_#in~c.base|) |func_to_recursive_line_24_to_25_0_#in~c.offset|)) (.cse2 (select (select |#memory_int#2| |func_to_recursive_line_24_to_25_0_#in~c.base|) |func_to_recursive_line_24_to_25_0_#in~c.offset|))) (and (<= 0 (+ 2147483649 .cse0)) (= |#memory_int#4| |old(#memory_int#4)|) (or (< 5 .cse1) (< .cse2 6)) (or (< .cse2 5) (< 4 .cse1)) (= |#memory_int#1| |old(#memory_int#1)|) (<= .cse0 5) (or (< 3 .cse1) (< .cse2 4)) (= (select (select |#memory_int#2| func_to_recursive_line_23_to_24_0_~c.base) func_to_recursive_line_23_to_24_0_~c.offset) 0)))) [2023-11-29 00:20:00,859 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2023-11-29 00:20:00,859 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (or (< (+ (select (select |old(#memory_int#3)| |func_to_recursive_line_22_to_23_0_#in~a.base|) |func_to_recursive_line_22_to_23_0_#in~a.offset|) 2147483648) 0) (and (<= 0 (+ 2147483648 (select (select |#memory_int#3| func_to_recursive_line_22_to_23_0_~a.base) func_to_recursive_line_22_to_23_0_~a.offset))) (exists ((v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#2| v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2) 2147483648)))) (forall ((v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |old(#memory_int#2)| v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2) 2147483648) 0))) [2023-11-29 00:20:00,859 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 90) no Hoare annotation was computed. [2023-11-29 00:20:00,859 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-11-29 00:20:00,860 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 90) no Hoare annotation was computed. [2023-11-29 00:20:00,860 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-11-29 00:20:00,860 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int#3| func_to_recursive_line_22_to_23_0_~a.base) func_to_recursive_line_22_to_23_0_~a.offset)) (.cse2 (select (select |#memory_int#3| |func_to_recursive_line_22_to_23_0_#in~a.base|) |func_to_recursive_line_22_to_23_0_#in~a.offset|)) (.cse3 (forall ((v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |old(#memory_int#2)| v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse0 (select (select |old(#memory_int#3)| |func_to_recursive_line_22_to_23_0_#in~a.base|) |func_to_recursive_line_22_to_23_0_#in~a.offset|))) (and (or (< (+ .cse0 2147483648) 0) (and (= (select (select |#memory_int#4| func_to_recursive_line_22_to_23_0_~b.base) func_to_recursive_line_22_to_23_0_~b.offset) 0) (<= 0 (+ 2147483648 .cse1)) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|) (<= 0 (+ .cse2 2147483648)) (<= .cse1 5)) .cse3) (or (and (= 0 .cse1) (= .cse2 0)) .cse3 (not (= .cse0 0))))) [2023-11-29 00:20:00,860 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-11-29 00:20:00,860 INFO L899 garLoopResultBuilder]: For program point L81(lines 81 96) no Hoare annotation was computed. [2023-11-29 00:20:00,860 INFO L899 garLoopResultBuilder]: For program point L81-1(lines 79 97) no Hoare annotation was computed. [2023-11-29 00:20:00,860 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 79 97) the Hoare annotation is: (let ((.cse2 (select (select |old(#memory_int#3)| |func_to_recursive_line_22_to_23_0_#in~a.base|) |func_to_recursive_line_22_to_23_0_#in~a.offset|)) (.cse0 (forall ((v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |old(#memory_int#2)| v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse1 (select (select |#memory_int#3| |func_to_recursive_line_22_to_23_0_#in~a.base|) |func_to_recursive_line_22_to_23_0_#in~a.offset|))) (and (or .cse0 (= .cse1 0) (not (= .cse2 0))) (or (< (+ .cse2 2147483648) 0) .cse0 (and (= |#memory_int#4| |old(#memory_int#4)|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|) (<= 0 (+ .cse1 2147483648)))))) [2023-11-29 00:20:00,860 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_22_to_23_0EXIT(lines 79 97) no Hoare annotation was computed. [2023-11-29 00:20:00,861 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (let ((.cse0 (select |old(#memory_int#1)| func_to_recursive_line_25_to_25_0_~d.base)) (.cse1 (select (select |#memory_int#1| func_to_recursive_line_25_to_25_0_~d.base) func_to_recursive_line_25_to_25_0_~d.offset))) (and (= |#memory_int#1| (store |old(#memory_int#1)| func_to_recursive_line_25_to_25_0_~d.base (store .cse0 func_to_recursive_line_25_to_25_0_~d.offset .cse1))) (<= .cse1 (+ (select .cse0 func_to_recursive_line_25_to_25_0_~d.offset) 1)) (<= 0 (+ 2147483648 .cse1)) (= |func_to_recursive_line_25_to_25_0_#in~d.base| func_to_recursive_line_25_to_25_0_~d.base) (= func_to_recursive_line_25_to_25_0_~d.offset |func_to_recursive_line_25_to_25_0_#in~d.offset|))) (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2) 2147483648) 0)) (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3))) (forall ((v_func_to_recursive_line_23_to_24_0_~b.base_BEFORE_CALL_4 Int) (v_func_to_recursive_line_23_to_24_0_~b.offset_BEFORE_CALL_5 Int)) (< 5 (select (select |#memory_int#4| v_func_to_recursive_line_23_to_24_0_~b.base_BEFORE_CALL_4) v_func_to_recursive_line_23_to_24_0_~b.offset_BEFORE_CALL_5))) (< (+ (select (select |old(#memory_int#1)| |func_to_recursive_line_25_to_25_0_#in~d.base|) |func_to_recursive_line_25_to_25_0_#in~d.offset|) 2147483648) 0) (forall ((v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#2| v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2) 2147483648) 0))) [2023-11-29 00:20:00,861 INFO L899 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2023-11-29 00:20:00,861 INFO L899 garLoopResultBuilder]: For program point L30-1(line 30) no Hoare annotation was computed. [2023-11-29 00:20:00,861 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_25_to_25_0EXIT(lines 23 37) no Hoare annotation was computed. [2023-11-29 00:20:00,861 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 36) no Hoare annotation was computed. [2023-11-29 00:20:00,861 INFO L899 garLoopResultBuilder]: For program point L25-1(lines 23 37) no Hoare annotation was computed. [2023-11-29 00:20:00,861 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 23 37) the Hoare annotation is: (or (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_2) 2147483648) 0)) (forall ((v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_22_to_23_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_22_to_23_0_~a.offset_BEFORE_CALL_3))) (= |#memory_int#1| |old(#memory_int#1)|) (forall ((v_func_to_recursive_line_23_to_24_0_~b.base_BEFORE_CALL_4 Int) (v_func_to_recursive_line_23_to_24_0_~b.offset_BEFORE_CALL_5 Int)) (< 5 (select (select |#memory_int#4| v_func_to_recursive_line_23_to_24_0_~b.base_BEFORE_CALL_4) v_func_to_recursive_line_23_to_24_0_~b.offset_BEFORE_CALL_5))) (< (+ (select (select |old(#memory_int#1)| |func_to_recursive_line_25_to_25_0_#in~d.base|) |func_to_recursive_line_25_to_25_0_#in~d.offset|) 2147483648) 0) (forall ((v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#2| v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2) 2147483648) 0))) [2023-11-29 00:20:00,861 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_25_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-11-29 00:20:00,861 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-11-29 00:20:00,862 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:20:00,862 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 00:20:00,862 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2023-11-29 00:20:00,862 INFO L895 garLoopResultBuilder]: At program point L107(line 107) the Hoare annotation is: (and (= (select (select |#memory_int#3| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (exists ((v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#2| v_func_to_recursive_line_24_to_25_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_24_to_25_0_~c.offset_BEFORE_CALL_2) 2147483648)))) [2023-11-29 00:20:00,862 INFO L899 garLoopResultBuilder]: For program point L109-2(line 109) no Hoare annotation was computed. [2023-11-29 00:20:00,862 INFO L899 garLoopResultBuilder]: For program point L107-1(line 107) no Hoare annotation was computed. [2023-11-29 00:20:00,862 INFO L899 garLoopResultBuilder]: For program point L109-3(line 109) no Hoare annotation was computed. [2023-11-29 00:20:00,862 INFO L899 garLoopResultBuilder]: For program point L109-5(line 109) no Hoare annotation was computed. [2023-11-29 00:20:00,862 INFO L899 garLoopResultBuilder]: For program point L109-6(line 109) no Hoare annotation was computed. [2023-11-29 00:20:00,862 INFO L899 garLoopResultBuilder]: For program point L109-8(lines 109 115) no Hoare annotation was computed. [2023-11-29 00:20:00,862 INFO L899 garLoopResultBuilder]: For program point L109-10(lines 109 115) no Hoare annotation was computed. [2023-11-29 00:20:00,865 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:20:00,866 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:20:00,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:20:00 BoogieIcfgContainer [2023-11-29 00:20:00,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:20:00,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:20:00,870 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:20:00,871 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:20:00,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:18:45" (3/4) ... [2023-11-29 00:20:00,872 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:20:00,875 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_24_to_25_0 [2023-11-29 00:20:00,875 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_23_to_24_0 [2023-11-29 00:20:00,875 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_22_to_23_0 [2023-11-29 00:20:00,875 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_25_to_25_0 [2023-11-29 00:20:00,880 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2023-11-29 00:20:00,880 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-29 00:20:00,880 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 00:20:00,881 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:20:00,964 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:20:00,964 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:20:00,964 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:20:00,965 INFO L158 Benchmark]: Toolchain (without parser) took 76237.89ms. Allocated memory was 169.9MB in the beginning and 901.8MB in the end (delta: 731.9MB). Free memory was 139.1MB in the beginning and 732.6MB in the end (delta: -593.5MB). Peak memory consumption was 137.7MB. Max. memory is 16.1GB. [2023-11-29 00:20:00,965 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:20:00,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.98ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 134.2MB in the end (delta: 4.7MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2023-11-29 00:20:00,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.99ms. Allocated memory is still 169.9MB. Free memory was 134.2MB in the beginning and 132.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:20:00,966 INFO L158 Benchmark]: Boogie Preprocessor took 50.30ms. Allocated memory is still 169.9MB. Free memory was 132.1MB in the beginning and 130.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:20:00,967 INFO L158 Benchmark]: RCFGBuilder took 432.60ms. Allocated memory is still 169.9MB. Free memory was 130.0MB in the beginning and 129.5MB in the end (delta: 471.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 00:20:00,967 INFO L158 Benchmark]: TraceAbstraction took 75382.87ms. Allocated memory was 169.9MB in the beginning and 901.8MB in the end (delta: 731.9MB). Free memory was 128.2MB in the beginning and 737.8MB in the end (delta: -609.6MB). Peak memory consumption was 123.1MB. Max. memory is 16.1GB. [2023-11-29 00:20:00,968 INFO L158 Benchmark]: Witness Printer took 94.11ms. Allocated memory is still 901.8MB. Free memory was 737.8MB in the beginning and 732.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 00:20:00,969 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.17ms. Allocated memory is still 130.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.98ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 134.2MB in the end (delta: 4.7MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.99ms. Allocated memory is still 169.9MB. Free memory was 134.2MB in the beginning and 132.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.30ms. Allocated memory is still 169.9MB. Free memory was 132.1MB in the beginning and 130.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.60ms. Allocated memory is still 169.9MB. Free memory was 130.0MB in the beginning and 129.5MB in the end (delta: 471.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 75382.87ms. Allocated memory was 169.9MB in the beginning and 901.8MB in the end (delta: 731.9MB). Free memory was 128.2MB in the beginning and 737.8MB in the end (delta: -609.6MB). Peak memory consumption was 123.1MB. Max. memory is 16.1GB. * Witness Printer took 94.11ms. Allocated memory is still 901.8MB. Free memory was 737.8MB in the beginning and 732.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 53 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 75.3s, OverallIterations: 18, TraceHistogramMax: 56, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 41.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 473 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 3479 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2859 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2657 IncrementalHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 620 mSDtfsCounter, 2657 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3705 GetRequests, 3356 SyntacticMatches, 11 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2684 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=13, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 39 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 168 PreInvPairs, 175 NumberOfFragments, 825 HoareAnnotationTreeSize, 168 FomulaSimplifications, 350 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 1724 FormulaSimplificationTreeSizeReductionInter, 41.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 24.9s InterpolantComputationTime, 4332 NumberOfCodeBlocks, 4249 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 5091 ConstructedInterpolants, 713 QuantifiedInterpolants, 16548 SizeOfPredicates, 56 NumberOfNonLiveVariables, 8783 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 33 InterpolantComputations, 14 PerfectInterpolantSequences, 60242/61348 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 00:20:01,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd6241fd-c9fd-4483-bf88-5b39b6d57abf/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE