./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu --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 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:37:00,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:37:00,462 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-19 07:37:00,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:37:00,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:37:00,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:37:00,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:37:00,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:37:00,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:37:00,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:37:00,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:37:00,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:37:00,516 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:37:00,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:37:00,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:37:00,517 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:37:00,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:37:00,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:37:00,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:37:00,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:37:00,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:37:00,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:37:00,521 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-19 07:37:00,521 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:37:00,522 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:37:00,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:37:00,523 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:37:00,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:37:00,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:37:00,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:37:00,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:37:00,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:37:00,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:37:00,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:37:00,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:37:00,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:37:00,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:37:00,527 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:37:00,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:37:00,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:37:00,528 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:37:00,529 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_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/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_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu 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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2023-11-19 07:37:00,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:37:00,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:37:00,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:37:00,869 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:37:00,870 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:37:00,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-19 07:37:04,007 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:37:04,247 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:37:04,248 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-19 07:37:04,256 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/data/b8119e393/ecb7db5aed204fcd8bf2250af12e5fda/FLAG24bbb59ef [2023-11-19 07:37:04,271 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/data/b8119e393/ecb7db5aed204fcd8bf2250af12e5fda [2023-11-19 07:37:04,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:37:04,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:37:04,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:37:04,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:37:04,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:37:04,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:04" (1/1) ... [2023-11-19 07:37:04,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ea938a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04, skipping insertion in model container [2023-11-19 07:37:04,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:04" (1/1) ... [2023-11-19 07:37:04,343 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:37:04,522 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:37:04,532 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:37:04,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:37:04,566 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:37:04,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04 WrapperNode [2023-11-19 07:37:04,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:37:04,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:37:04,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:37:04,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:37:04,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04" (1/1) ... [2023-11-19 07:37:04,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04" (1/1) ... [2023-11-19 07:37:04,602 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2023-11-19 07:37:04,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:37:04,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:37:04,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:37:04,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:37:04,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04" (1/1) ... [2023-11-19 07:37:04,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04" (1/1) ... [2023-11-19 07:37:04,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04" (1/1) ... [2023-11-19 07:37:04,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04" (1/1) ... [2023-11-19 07:37:04,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04" (1/1) ... [2023-11-19 07:37:04,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04" (1/1) ... [2023-11-19 07:37:04,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04" (1/1) ... [2023-11-19 07:37:04,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04" (1/1) ... [2023-11-19 07:37:04,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:37:04,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:37:04,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:37:04,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:37:04,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04" (1/1) ... [2023-11-19 07:37:04,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:37:04,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:04,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:37:04,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:37:04,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:37:04,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:37:04,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:37:04,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:37:04,725 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2023-11-19 07:37:04,726 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2023-11-19 07:37:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-19 07:37:04,726 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-19 07:37:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:37:04,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:37:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:37:04,728 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2023-11-19 07:37:04,728 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2023-11-19 07:37:04,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:37:04,839 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:37:04,842 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:37:05,124 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:37:05,133 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:37:05,134 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:37:05,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:05 BoogieIcfgContainer [2023-11-19 07:37:05,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:37:05,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:37:05,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:37:05,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:37:05,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:37:04" (1/3) ... [2023-11-19 07:37:05,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73717232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:05, skipping insertion in model container [2023-11-19 07:37:05,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:04" (2/3) ... [2023-11-19 07:37:05,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73717232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:05, skipping insertion in model container [2023-11-19 07:37:05,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:05" (3/3) ... [2023-11-19 07:37:05,148 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2023-11-19 07:37:05,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:37:05,176 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-19 07:37:05,228 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:37:05,235 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;@fa77c9b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:37:05,235 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:37:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 37 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:37:05,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 07:37:05,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:05,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:05,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 07:37:05,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash -946069669, now seen corresponding path program 1 times [2023-11-19 07:37:05,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:05,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096362615] [2023-11-19 07:37:05,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:05,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:05,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:05,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096362615] [2023-11-19 07:37:05,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096362615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:05,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:05,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:05,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221617976] [2023-11-19 07:37:05,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:05,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:37:05,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:05,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:37:05,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:05,943 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 37 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:37:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:06,075 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2023-11-19 07:37:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:37:06,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 07:37:06,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:06,085 INFO L225 Difference]: With dead ends: 89 [2023-11-19 07:37:06,086 INFO L226 Difference]: Without dead ends: 37 [2023-11-19 07:37:06,089 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-19 07:37:06,093 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:06,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 181 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-19 07:37:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2023-11-19 07:37:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.380952380952381) internal successors, (29), 28 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:37:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-19 07:37:06,133 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 12 [2023-11-19 07:37:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:06,134 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-19 07:37:06,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:37:06,134 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-19 07:37:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 07:37:06,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:06,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:06,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:37:06,137 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 07:37:06,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:06,137 INFO L85 PathProgramCache]: Analyzing trace with hash 736611370, now seen corresponding path program 1 times [2023-11-19 07:37:06,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:06,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342196253] [2023-11-19 07:37:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:06,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:06,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:06,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342196253] [2023-11-19 07:37:06,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342196253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:06,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:06,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:37:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068655988] [2023-11-19 07:37:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:06,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:06,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:06,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:06,243 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:37:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:06,288 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2023-11-19 07:37:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:06,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 07:37:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:06,290 INFO L225 Difference]: With dead ends: 35 [2023-11-19 07:37:06,290 INFO L226 Difference]: Without dead ends: 34 [2023-11-19 07:37:06,291 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-19 07:37:06,292 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:06,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 79 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:37:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-19 07:37:06,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-19 07:37:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:37:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-11-19 07:37:06,301 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 13 [2023-11-19 07:37:06,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:06,301 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-11-19 07:37:06,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:37:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-11-19 07:37:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 07:37:06,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:06,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:06,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:37:06,304 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 07:37:06,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:06,304 INFO L85 PathProgramCache]: Analyzing trace with hash -939107226, now seen corresponding path program 1 times [2023-11-19 07:37:06,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:06,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85285175] [2023-11-19 07:37:06,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:06,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:06,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:37:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:06,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:06,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85285175] [2023-11-19 07:37:06,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85285175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:06,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:06,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:37:06,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894736612] [2023-11-19 07:37:06,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:06,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:37:06,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:06,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:37:06,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:06,535 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-19 07:37:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:06,645 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2023-11-19 07:37:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:37:06,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2023-11-19 07:37:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:06,648 INFO L225 Difference]: With dead ends: 69 [2023-11-19 07:37:06,649 INFO L226 Difference]: Without dead ends: 38 [2023-11-19 07:37:06,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-19 07:37:06,651 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:06,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 93 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:06,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-19 07:37:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-19 07:37:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 07:37:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-11-19 07:37:06,675 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 12 [2023-11-19 07:37:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:06,676 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-11-19 07:37:06,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-19 07:37:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-11-19 07:37:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 07:37:06,678 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:06,679 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:06,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:37:06,680 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 07:37:06,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:06,681 INFO L85 PathProgramCache]: Analyzing trace with hash 497085987, now seen corresponding path program 1 times [2023-11-19 07:37:06,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:06,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326105748] [2023-11-19 07:37:06,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:06,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:07,007 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-19 07:37:07,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:07,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326105748] [2023-11-19 07:37:07,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326105748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:07,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:07,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:37:07,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466698666] [2023-11-19 07:37:07,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:07,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:37:07,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:07,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:37:07,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:37:07,014 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-19 07:37:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:07,153 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-19 07:37:07,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:37:07,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2023-11-19 07:37:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:07,158 INFO L225 Difference]: With dead ends: 42 [2023-11-19 07:37:07,159 INFO L226 Difference]: Without dead ends: 41 [2023-11-19 07:37:07,160 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-19 07:37:07,171 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:07,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 124 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-19 07:37:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2023-11-19 07:37:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 07:37:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-19 07:37:07,193 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 17 [2023-11-19 07:37:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:07,193 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-19 07:37:07,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-19 07:37:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-11-19 07:37:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 07:37:07,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:07,196 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] [2023-11-19 07:37:07,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:37:07,196 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 07:37:07,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1200173767, now seen corresponding path program 1 times [2023-11-19 07:37:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:07,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100575311] [2023-11-19 07:37:07,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:07,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:07,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:37:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:07,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:37:07,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:07,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100575311] [2023-11-19 07:37:07,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100575311] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:07,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062521480] [2023-11-19 07:37:07,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:07,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:07,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:07,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:07,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:37:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:08,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-19 07:37:08,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:08,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-11-19 07:37:08,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:37:08,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:37:08,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:37:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:37:08,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:37:08,619 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_86 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base v_ArrVal_86) c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset) 2147483650))) is different from false [2023-11-19 07:37:08,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062521480] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:08,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:37:08,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2023-11-19 07:37:08,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717244067] [2023-11-19 07:37:08,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:37:08,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-19 07:37:08,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:08,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-19 07:37:08,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=412, Unknown=1, NotChecked=40, Total=506 [2023-11-19 07:37:08,625 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 20 states, 16 states have (on average 1.9375) internal successors, (31), 17 states have internal predecessors, (31), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:37:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:09,177 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2023-11-19 07:37:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 07:37:09,177 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.9375) internal successors, (31), 17 states have internal predecessors, (31), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 22 [2023-11-19 07:37:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:09,179 INFO L225 Difference]: With dead ends: 76 [2023-11-19 07:37:09,179 INFO L226 Difference]: Without dead ends: 41 [2023-11-19 07:37:09,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=989, Unknown=1, NotChecked=64, Total=1190 [2023-11-19 07:37:09,181 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 34 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:09,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 222 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:37:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-19 07:37:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-11-19 07:37:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.24) internal successors, (31), 29 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-19 07:37:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2023-11-19 07:37:09,191 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 22 [2023-11-19 07:37:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:09,191 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2023-11-19 07:37:09,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.9375) internal successors, (31), 17 states have internal predecessors, (31), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:37:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2023-11-19 07:37:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-19 07:37:09,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:09,193 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:09,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:37:09,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:09,416 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 07:37:09,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:09,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1081708851, now seen corresponding path program 2 times [2023-11-19 07:37:09,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:09,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689634506] [2023-11-19 07:37:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:09,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:09,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:37:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:10,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:10,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:37:10,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:10,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689634506] [2023-11-19 07:37:10,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689634506] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:10,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162249403] [2023-11-19 07:37:10,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:37:10,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:10,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:10,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:10,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:37:10,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:37:10,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:37:10,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-19 07:37:10,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:10,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:37:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 07:37:10,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:37:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:11,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162249403] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:37:11,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:37:11,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 16] total 32 [2023-11-19 07:37:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229807487] [2023-11-19 07:37:11,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:37:11,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-19 07:37:11,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:11,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-19 07:37:11,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2023-11-19 07:37:11,727 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 32 states, 25 states have (on average 1.64) internal successors, (41), 28 states have internal predecessors, (41), 8 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-19 07:37:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:12,187 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2023-11-19 07:37:12,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:37:12,188 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 1.64) internal successors, (41), 28 states have internal predecessors, (41), 8 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) Word has length 29 [2023-11-19 07:37:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:12,189 INFO L225 Difference]: With dead ends: 81 [2023-11-19 07:37:12,189 INFO L226 Difference]: Without dead ends: 44 [2023-11-19 07:37:12,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=1130, Unknown=0, NotChecked=0, Total=1406 [2023-11-19 07:37:12,191 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:12,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 213 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:37:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-19 07:37:12,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-19 07:37:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-19 07:37:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2023-11-19 07:37:12,201 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 29 [2023-11-19 07:37:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:12,202 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2023-11-19 07:37:12,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 1.64) internal successors, (41), 28 states have internal predecessors, (41), 8 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-19 07:37:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2023-11-19 07:37:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-19 07:37:12,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:12,204 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:12,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-19 07:37:12,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 07:37:12,425 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 07:37:12,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:12,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1508014537, now seen corresponding path program 3 times [2023-11-19 07:37:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:12,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726614292] [2023-11-19 07:37:12,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:12,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:37:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:13,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:13,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:13,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:13,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-19 07:37:14,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726614292] [2023-11-19 07:37:14,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726614292] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:14,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257753527] [2023-11-19 07:37:14,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 07:37:14,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:14,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:14,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:14,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:37:14,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-19 07:37:14,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:37:14,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-19 07:37:14,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:14,244 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-19 07:37:14,865 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-19 07:37:14,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:37:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:17,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257753527] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:37:17,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:37:17,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 26] total 50 [2023-11-19 07:37:17,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054791478] [2023-11-19 07:37:17,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:37:17,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-19 07:37:17,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:17,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-19 07:37:17,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=2084, Unknown=0, NotChecked=0, Total=2450 [2023-11-19 07:37:17,513 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 50 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 42 states have internal predecessors, (58), 13 states have call successors, (14), 9 states have call predecessors, (14), 11 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2023-11-19 07:37:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:18,396 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2023-11-19 07:37:18,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-19 07:37:18,397 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 42 states have internal predecessors, (58), 13 states have call successors, (14), 9 states have call predecessors, (14), 11 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) Word has length 43 [2023-11-19 07:37:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:18,398 INFO L225 Difference]: With dead ends: 89 [2023-11-19 07:37:18,398 INFO L226 Difference]: Without dead ends: 48 [2023-11-19 07:37:18,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=574, Invalid=3458, Unknown=0, NotChecked=0, Total=4032 [2023-11-19 07:37:18,410 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:18,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 311 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:37:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-19 07:37:18,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-19 07:37:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.206896551724138) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-19 07:37:18,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-11-19 07:37:18,439 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 43 [2023-11-19 07:37:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:18,442 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-11-19 07:37:18,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 42 states have internal predecessors, (58), 13 states have call successors, (14), 9 states have call predecessors, (14), 11 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2023-11-19 07:37:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-11-19 07:37:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 07:37:18,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:18,447 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:18,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:37:18,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:18,671 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 07:37:18,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash 437216965, now seen corresponding path program 4 times [2023-11-19 07:37:18,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:18,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124913560] [2023-11-19 07:37:18,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:18,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:19,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:37:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:19,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:19,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:20,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:20,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:20,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:20,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-11-19 07:37:20,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:20,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124913560] [2023-11-19 07:37:20,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124913560] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:20,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083946618] [2023-11-19 07:37:20,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 07:37:20,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:20,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:20,730 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:20,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:37:20,884 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 07:37:20,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:37:20,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-19 07:37:20,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:20,973 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-19 07:37:21,087 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-19 07:37:21,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-19 07:37:21,890 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2023-11-19 07:37:21,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 18 [2023-11-19 07:37:21,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:21,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2023-11-19 07:37:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 23 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-11-19 07:37:22,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:37:22,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083946618] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:22,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:37:22,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 31 [2023-11-19 07:37:22,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049929702] [2023-11-19 07:37:22,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:37:22,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-19 07:37:22,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:22,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-19 07:37:22,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1065, Unknown=0, NotChecked=0, Total=1190 [2023-11-19 07:37:22,933 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 26 states have internal predecessors, (34), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-19 07:37:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:23,818 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-11-19 07:37:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-19 07:37:23,819 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 26 states have internal predecessors, (34), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 57 [2023-11-19 07:37:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:23,822 INFO L225 Difference]: With dead ends: 54 [2023-11-19 07:37:23,822 INFO L226 Difference]: Without dead ends: 52 [2023-11-19 07:37:23,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 52 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=263, Invalid=2187, Unknown=0, NotChecked=0, Total=2450 [2023-11-19 07:37:23,825 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:23,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 350 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:37:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-19 07:37:23,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-19 07:37:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.1875) internal successors, (38), 36 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-19 07:37:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-11-19 07:37:23,842 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 57 [2023-11-19 07:37:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:23,842 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-11-19 07:37:23,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 26 states have internal predecessors, (34), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-19 07:37:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-11-19 07:37:23,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-19 07:37:23,854 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:23,854 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:23,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 07:37:24,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:24,062 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 07:37:24,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:24,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1784293452, now seen corresponding path program 1 times [2023-11-19 07:37:24,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:24,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296033640] [2023-11-19 07:37:24,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:24,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:24,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:37:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:25,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:37:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:25,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:25,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:26,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:26,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:26,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:26,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:26,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-19 07:37:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:37:26,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:26,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296033640] [2023-11-19 07:37:26,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296033640] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:26,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364339233] [2023-11-19 07:37:26,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:26,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:26,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:26,556 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:26,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 07:37:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:26,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 86 conjunts are in the unsatisfiable core [2023-11-19 07:37:26,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:26,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2023-11-19 07:37:26,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:37:29,060 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) is different from false [2023-11-19 07:37:31,070 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) is different from true [2023-11-19 07:37:33,119 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2023-11-19 07:37:35,121 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2023-11-19 07:37:37,159 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_57| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_57| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_57| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_57| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_57|))))) is different from false [2023-11-19 07:37:39,161 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_57| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_57| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_57| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_57| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_57|))))) is different from true [2023-11-19 07:37:41,201 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_58| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_58| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_58| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_58| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_58| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) is different from false [2023-11-19 07:37:43,202 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_58| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_58| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_58| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_58| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_58| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) is different from true [2023-11-19 07:37:45,249 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_int)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_28| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_28| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= |v_old(#memory_int)_AFTER_CALL_28| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_28| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_#memory_int|)) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2023-11-19 07:37:47,251 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_int)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_28| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_28| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= |v_old(#memory_int)_AFTER_CALL_28| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_28| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_#memory_int|)) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2023-11-19 07:37:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 93 trivial. 18 not checked. [2023-11-19 07:37:47,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:37:47,871 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int))) (< (select (select (store |c_#memory_int| c_func_to_recursive_line_21_to_22_0_~c.base v_ArrVal_458) c_func_to_recursive_line_21_to_22_0_~b.base) c_func_to_recursive_line_21_to_22_0_~b.offset) 5)) is different from false [2023-11-19 07:37:47,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364339233] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:47,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:37:47,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 29 [2023-11-19 07:37:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663200872] [2023-11-19 07:37:47,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:37:47,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-19 07:37:47,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:47,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-19 07:37:47,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=476, Unknown=12, NotChecked=294, Total=870 [2023-11-19 07:37:47,875 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 29 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2023-11-19 07:37:50,121 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_57| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_57| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1) (= (store |v_#memory_int_BEFORE_CALL_57| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_57| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_57|))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse3))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_58| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_58| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse4) (= (store |v_#memory_int_BEFORE_CALL_58| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_58| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_58| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))))) is different from false [2023-11-19 07:37:50,127 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_57| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_57| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1) (= (store |v_#memory_int_BEFORE_CALL_57| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_57| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_57|))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse3))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_58| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_58| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse4) (= (store |v_#memory_int_BEFORE_CALL_58| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_58| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_58| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))))) is different from true [2023-11-19 07:37:52,159 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_int)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_28| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_28| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= |v_old(#memory_int)_AFTER_CALL_28| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_28| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_#memory_int|)) (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2023-11-19 07:37:52,162 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_int)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_28| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_28| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= |v_old(#memory_int)_AFTER_CALL_28| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_28| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_#memory_int|)) (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2023-11-19 07:37:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:52,455 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2023-11-19 07:37:52,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-19 07:37:52,456 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) Word has length 67 [2023-11-19 07:37:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:52,457 INFO L225 Difference]: With dead ends: 103 [2023-11-19 07:37:52,457 INFO L226 Difference]: Without dead ends: 54 [2023-11-19 07:37:52,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 67 SyntacticMatches, 16 SemanticMatches, 39 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=162, Invalid=908, Unknown=18, NotChecked=552, Total=1640 [2023-11-19 07:37:52,459 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:52,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 171 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 367 Invalid, 3 Unknown, 234 Unchecked, 0.3s Time] [2023-11-19 07:37:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-19 07:37:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-19 07:37:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 37 states have internal predecessors, (39), 7 states have call successors, (7), 5 states have call predecessors, (7), 10 states have return successors, (13), 11 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-19 07:37:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2023-11-19 07:37:52,473 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 67 [2023-11-19 07:37:52,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:52,474 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2023-11-19 07:37:52,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2023-11-19 07:37:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2023-11-19 07:37:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-19 07:37:52,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:52,477 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:52,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 07:37:52,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b934cde-5639-444d-a3d5-d427a2489756/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:52,690 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-19 07:37:52,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:52,690 INFO L85 PathProgramCache]: Analyzing trace with hash 487027498, now seen corresponding path program 1 times [2023-11-19 07:37:52,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:52,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403563078] [2023-11-19 07:37:52,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:52,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:53,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:37:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:54,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:54,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:54,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:54,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:54,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:55,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:55,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:37:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:55,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:55,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:55,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:55,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:37:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat