./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/recursified_loop-simple/recursified_deep-nested.c --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/recursified_loop-simple/recursified_deep-nested.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 20:55:19,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 20:55:19,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 20:55:19,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 20:55:19,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 20:55:19,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 20:55:19,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 20:55:19,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 20:55:19,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 20:55:19,548 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 20:55:19,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 20:55:19,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 20:55:19,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 20:55:19,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 20:55:19,550 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 20:55:19,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 20:55:19,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 20:55:19,551 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 20:55:19,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 20:55:19,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 20:55:19,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 20:55:19,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 20:55:19,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 20:55:19,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 20:55:19,552 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 20:55:19,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 20:55:19,553 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 20:55:19,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 20:55:19,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 20:55:19,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 20:55:19,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 20:55:19,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 20:55:19,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 20:55:19,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 20:55:19,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 20:55:19,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 20:55:19,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 20:55:19,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 20:55:19,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 20:55:19,556 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 20:55:19,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 20:55:19,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 20:55:19,557 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 20:55:19,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 20:55:19,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 20:55:19,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 20:55:19,794 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 20:55:19,794 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 20:55:19,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_loop-simple/recursified_deep-nested.c [2023-11-22 20:55:20,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 20:55:21,147 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 20:55:21,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-simple/recursified_deep-nested.c [2023-11-22 20:55:21,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e884e7600/6516aa633977444895c9048fa271d52f/FLAG441bd7662 [2023-11-22 20:55:21,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e884e7600/6516aa633977444895c9048fa271d52f [2023-11-22 20:55:21,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 20:55:21,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 20:55:21,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 20:55:21,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 20:55:21,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 20:55:21,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:55:21" (1/1) ... [2023-11-22 20:55:21,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc16223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21, skipping insertion in model container [2023-11-22 20:55:21,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:55:21" (1/1) ... [2023-11-22 20:55:21,201 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 20:55:21,320 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-simple/recursified_deep-nested.c[1440,1453] [2023-11-22 20:55:21,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 20:55:21,344 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 20:55:21,353 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-simple/recursified_deep-nested.c[1440,1453] [2023-11-22 20:55:21,378 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 20:55:21,390 INFO L206 MainTranslator]: Completed translation [2023-11-22 20:55:21,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21 WrapperNode [2023-11-22 20:55:21,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 20:55:21,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 20:55:21,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 20:55:21,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 20:55:21,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21" (1/1) ... [2023-11-22 20:55:21,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21" (1/1) ... [2023-11-22 20:55:21,423 INFO L138 Inliner]: procedures = 16, calls = 71, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2023-11-22 20:55:21,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 20:55:21,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 20:55:21,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 20:55:21,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 20:55:21,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21" (1/1) ... [2023-11-22 20:55:21,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21" (1/1) ... [2023-11-22 20:55:21,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21" (1/1) ... [2023-11-22 20:55:21,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21" (1/1) ... [2023-11-22 20:55:21,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21" (1/1) ... [2023-11-22 20:55:21,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21" (1/1) ... [2023-11-22 20:55:21,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21" (1/1) ... [2023-11-22 20:55:21,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21" (1/1) ... [2023-11-22 20:55:21,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 20:55:21,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 20:55:21,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 20:55:21,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 20:55:21,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21" (1/1) ... [2023-11-22 20:55:21,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 20:55:21,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:55:21,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 20:55:21,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 20:55:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_13_0 [2023-11-22 20:55:21,610 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_13_0 [2023-11-22 20:55:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 20:55:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_13_to_14_0 [2023-11-22 20:55:21,610 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_13_to_14_0 [2023-11-22 20:55:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_11_to_12_0 [2023-11-22 20:55:21,610 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_11_to_12_0 [2023-11-22 20:55:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 20:55:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_14_to_16_0 [2023-11-22 20:55:21,612 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_14_to_16_0 [2023-11-22 20:55:21,613 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_10_to_11_0 [2023-11-22 20:55:21,613 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_10_to_11_0 [2023-11-22 20:55:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 20:55:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 20:55:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 20:55:21,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 20:55:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 20:55:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 20:55:21,748 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 20:55:21,750 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 20:55:22,049 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 20:55:22,067 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 20:55:22,067 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-22 20:55:22,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:55:22 BoogieIcfgContainer [2023-11-22 20:55:22,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 20:55:22,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 20:55:22,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 20:55:22,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 20:55:22,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:55:21" (1/3) ... [2023-11-22 20:55:22,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d676b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:55:22, skipping insertion in model container [2023-11-22 20:55:22,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:21" (2/3) ... [2023-11-22 20:55:22,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d676b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:55:22, skipping insertion in model container [2023-11-22 20:55:22,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:55:22" (3/3) ... [2023-11-22 20:55:22,087 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_deep-nested.c [2023-11-22 20:55:22,101 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 20:55:22,101 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 20:55:22,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 20:55:22,205 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;@7dc5d609, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 20:55:22,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 20:55:22,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 37 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-22 20:55:22,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 20:55:22,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:22,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:55:22,229 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:55:22,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:22,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2021789981, now seen corresponding path program 1 times [2023-11-22 20:55:22,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:22,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991966015] [2023-11-22 20:55:22,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:22,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:22,623 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-22 20:55:22,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991966015] [2023-11-22 20:55:22,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991966015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:55:22,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:55:22,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 20:55:22,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848975524] [2023-11-22 20:55:22,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:55:22,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 20:55:22,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 20:55:22,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 20:55:22,671 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 37 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 20:55:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:22,730 INFO L93 Difference]: Finished difference Result 106 states and 150 transitions. [2023-11-22 20:55:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 20:55:22,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-22 20:55:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:22,741 INFO L225 Difference]: With dead ends: 106 [2023-11-22 20:55:22,741 INFO L226 Difference]: Without dead ends: 56 [2023-11-22 20:55:22,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 20:55:22,747 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 21 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:22,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 167 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 20:55:22,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-22 20:55:22,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2023-11-22 20:55:22,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 36 states have internal predecessors, (40), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 20:55:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2023-11-22 20:55:22,776 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 25 [2023-11-22 20:55:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:22,776 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2023-11-22 20:55:22,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 20:55:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2023-11-22 20:55:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 20:55:22,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:22,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:55:22,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 20:55:22,779 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:55:22,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:22,780 INFO L85 PathProgramCache]: Analyzing trace with hash -246782619, now seen corresponding path program 1 times [2023-11-22 20:55:22,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:22,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507974954] [2023-11-22 20:55:22,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:22,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:22,905 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-22 20:55:22,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:22,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507974954] [2023-11-22 20:55:22,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507974954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:55:22,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:55:22,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 20:55:22,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304928019] [2023-11-22 20:55:22,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:55:22,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 20:55:22,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:22,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 20:55:22,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 20:55:22,910 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 20:55:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:22,946 INFO L93 Difference]: Finished difference Result 98 states and 135 transitions. [2023-11-22 20:55:22,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 20:55:22,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-22 20:55:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:22,949 INFO L225 Difference]: With dead ends: 98 [2023-11-22 20:55:22,949 INFO L226 Difference]: Without dead ends: 54 [2023-11-22 20:55:22,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 20:55:22,951 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:22,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 152 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 20:55:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-22 20:55:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2023-11-22 20:55:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 20:55:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2023-11-22 20:55:22,959 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 25 [2023-11-22 20:55:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:22,960 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2023-11-22 20:55:22,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 20:55:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2023-11-22 20:55:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 20:55:22,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:22,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:55:22,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 20:55:22,962 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:55:22,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:22,962 INFO L85 PathProgramCache]: Analyzing trace with hash -244935577, now seen corresponding path program 1 times [2023-11-22 20:55:22,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:22,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667709425] [2023-11-22 20:55:22,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:22,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:23,052 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-22 20:55:23,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:23,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667709425] [2023-11-22 20:55:23,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667709425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:55:23,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:55:23,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 20:55:23,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992632853] [2023-11-22 20:55:23,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:55:23,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 20:55:23,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:23,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 20:55:23,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 20:55:23,056 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 20:55:23,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:23,164 INFO L93 Difference]: Finished difference Result 98 states and 133 transitions. [2023-11-22 20:55:23,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 20:55:23,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-22 20:55:23,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:23,166 INFO L225 Difference]: With dead ends: 98 [2023-11-22 20:55:23,167 INFO L226 Difference]: Without dead ends: 52 [2023-11-22 20:55:23,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 20:55:23,169 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:23,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 151 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 20:55:23,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-22 20:55:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-11-22 20:55:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 20:55:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-11-22 20:55:23,180 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 25 [2023-11-22 20:55:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:23,180 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-11-22 20:55:23,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 20:55:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-11-22 20:55:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 20:55:23,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:23,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:55:23,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 20:55:23,183 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:55:23,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:23,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1593118945, now seen corresponding path program 1 times [2023-11-22 20:55:23,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:23,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723598446] [2023-11-22 20:55:23,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:23,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:25,983 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-22 20:55:25,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:25,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723598446] [2023-11-22 20:55:25,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723598446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:55:25,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:55:25,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-22 20:55:25,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90531529] [2023-11-22 20:55:25,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:55:25,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-22 20:55:25,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:25,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-22 20:55:25,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2023-11-22 20:55:25,987 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 20:55:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:26,695 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2023-11-22 20:55:26,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-22 20:55:26,695 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-22 20:55:26,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:26,699 INFO L225 Difference]: With dead ends: 133 [2023-11-22 20:55:26,700 INFO L226 Difference]: Without dead ends: 84 [2023-11-22 20:55:26,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2023-11-22 20:55:26,707 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:26,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 528 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 20:55:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-22 20:55:26,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2023-11-22 20:55:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 59 states have internal predecessors, (68), 14 states have call successors, (14), 10 states have call predecessors, (14), 5 states have return successors, (13), 8 states have call predecessors, (13), 12 states have call successors, (13) [2023-11-22 20:55:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2023-11-22 20:55:26,730 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 25 [2023-11-22 20:55:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:26,731 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2023-11-22 20:55:26,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 20:55:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2023-11-22 20:55:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-22 20:55:26,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:26,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:55:26,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 20:55:26,737 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:55:26,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:26,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1542600501, now seen corresponding path program 1 times [2023-11-22 20:55:26,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:26,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103748286] [2023-11-22 20:55:26,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:26,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:27,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 20:55:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 20:55:27,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:27,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103748286] [2023-11-22 20:55:27,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103748286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:55:27,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:55:27,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-22 20:55:27,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713966295] [2023-11-22 20:55:27,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:55:27,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 20:55:27,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:27,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 20:55:27,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-22 20:55:27,966 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 20:55:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:28,234 INFO L93 Difference]: Finished difference Result 131 states and 169 transitions. [2023-11-22 20:55:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 20:55:28,235 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2023-11-22 20:55:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:28,236 INFO L225 Difference]: With dead ends: 131 [2023-11-22 20:55:28,237 INFO L226 Difference]: Without dead ends: 80 [2023-11-22 20:55:28,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-11-22 20:55:28,252 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:28,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 274 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 20:55:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-22 20:55:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-22 20:55:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 61 states have internal predecessors, (70), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (20), 8 states have call predecessors, (20), 12 states have call successors, (20) [2023-11-22 20:55:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2023-11-22 20:55:28,262 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 34 [2023-11-22 20:55:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:28,263 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2023-11-22 20:55:28,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 20:55:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2023-11-22 20:55:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-22 20:55:28,263 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:28,264 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:55:28,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 20:55:28,264 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:55:28,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1196697489, now seen corresponding path program 1 times [2023-11-22 20:55:28,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:28,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919887519] [2023-11-22 20:55:28,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:28,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 20:55:29,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:29,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919887519] [2023-11-22 20:55:29,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919887519] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:55:29,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35116709] [2023-11-22 20:55:29,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:29,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:55:29,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:55:29,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 20:55:29,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 20:55:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:29,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-22 20:55:29,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:55:29,305 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 6710 treesize of output 6646 [2023-11-22 20:55:29,353 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-22 20:55:29,369 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 19 treesize of output 18 [2023-11-22 20:55:29,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-22 20:55:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 20:55:29,550 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 20:55:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 20:55:29,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35116709] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 20:55:29,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 20:55:29,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 31 [2023-11-22 20:55:29,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211790717] [2023-11-22 20:55:29,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 20:55:29,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-22 20:55:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:29,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-22 20:55:29,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2023-11-22 20:55:29,989 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 32 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 21 states have internal predecessors, (62), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 20:55:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:31,332 INFO L93 Difference]: Finished difference Result 235 states and 313 transitions. [2023-11-22 20:55:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-22 20:55:31,333 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 21 states have internal predecessors, (62), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-22 20:55:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:31,334 INFO L225 Difference]: With dead ends: 235 [2023-11-22 20:55:31,334 INFO L226 Difference]: Without dead ends: 178 [2023-11-22 20:55:31,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=316, Invalid=2764, Unknown=0, NotChecked=0, Total=3080 [2023-11-22 20:55:31,336 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 216 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:31,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 718 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 20:55:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-22 20:55:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2023-11-22 20:55:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 130 states have internal predecessors, (154), 18 states have call successors, (18), 15 states have call predecessors, (18), 16 states have return successors, (32), 11 states have call predecessors, (32), 16 states have call successors, (32) [2023-11-22 20:55:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 204 transitions. [2023-11-22 20:55:31,374 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 204 transitions. Word has length 37 [2023-11-22 20:55:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:31,375 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 204 transitions. [2023-11-22 20:55:31,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 21 states have internal predecessors, (62), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 20:55:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 204 transitions. [2023-11-22 20:55:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-22 20:55:31,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:31,376 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:55:31,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 20:55:31,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-22 20:55:31,589 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:55:31,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:31,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1755939354, now seen corresponding path program 1 times [2023-11-22 20:55:31,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:31,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330422881] [2023-11-22 20:55:31,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:33,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:55:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:55:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 20:55:33,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:33,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330422881] [2023-11-22 20:55:33,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330422881] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:55:33,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3266657] [2023-11-22 20:55:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:33,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:55:33,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:55:33,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 20:55:33,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 20:55:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:33,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-22 20:55:33,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:55:33,587 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 1670 treesize of output 1654 [2023-11-22 20:55:33,747 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-22 20:55:33,853 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-22 20:55:33,933 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 19 treesize of output 11 [2023-11-22 20:55:34,022 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 19 treesize of output 18 [2023-11-22 20:55:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 20:55:34,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 20:55:34,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3266657] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:55:34,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 20:55:34,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 43 [2023-11-22 20:55:34,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267676091] [2023-11-22 20:55:34,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 20:55:34,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-22 20:55:34,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:34,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-22 20:55:34,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2354, Unknown=35, NotChecked=0, Total=2550 [2023-11-22 20:55:34,672 INFO L87 Difference]: Start difference. First operand 157 states and 204 transitions. Second operand has 44 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 30 states have internal predecessors, (60), 16 states have call successors, (16), 13 states have call predecessors, (16), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 20:55:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:37,335 INFO L93 Difference]: Finished difference Result 395 states and 520 transitions. [2023-11-22 20:55:37,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-22 20:55:37,336 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 30 states have internal predecessors, (60), 16 states have call successors, (16), 13 states have call predecessors, (16), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2023-11-22 20:55:37,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:37,337 INFO L225 Difference]: With dead ends: 395 [2023-11-22 20:55:37,338 INFO L226 Difference]: Without dead ends: 261 [2023-11-22 20:55:37,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=646, Invalid=8216, Unknown=68, NotChecked=0, Total=8930 [2023-11-22 20:55:37,340 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 222 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 2081 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:37,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 992 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2081 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 20:55:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-11-22 20:55:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 200. [2023-11-22 20:55:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 149 states have (on average 1.2684563758389262) internal successors, (189), 161 states have internal predecessors, (189), 26 states have call successors, (26), 21 states have call predecessors, (26), 24 states have return successors, (52), 19 states have call predecessors, (52), 24 states have call successors, (52) [2023-11-22 20:55:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 267 transitions. [2023-11-22 20:55:37,364 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 267 transitions. Word has length 48 [2023-11-22 20:55:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:37,364 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 267 transitions. [2023-11-22 20:55:37,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 30 states have internal predecessors, (60), 16 states have call successors, (16), 13 states have call predecessors, (16), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 20:55:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 267 transitions. [2023-11-22 20:55:37,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-22 20:55:37,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:37,366 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:55:37,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 20:55:37,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-22 20:55:37,580 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:55:37,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:37,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1819595530, now seen corresponding path program 2 times [2023-11-22 20:55:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:37,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135972924] [2023-11-22 20:55:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:39,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:55:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:39,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:55:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:39,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 20:55:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-22 20:55:39,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:39,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135972924] [2023-11-22 20:55:39,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135972924] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:55:39,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190828800] [2023-11-22 20:55:39,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 20:55:39,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:55:39,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:55:39,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 20:55:39,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 20:55:40,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 20:55:40,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 20:55:40,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 224 conjunts are in the unsatisfiable core [2023-11-22 20:55:40,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:55:40,062 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 20:55:40,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 50 [2023-11-22 20:55:40,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-22 20:55:40,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 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-22 20:55:40,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-22 20:55:40,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-22 20:55:40,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-22 20:55:40,737 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 20:55:40,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2023-11-22 20:55:40,849 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-22 20:55:40,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 20 [2023-11-22 20:55:40,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 20:55:41,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 20:55:41,171 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 19 treesize of output 18 [2023-11-22 20:55:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-22 20:55:41,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 20:55:41,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190828800] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:55:41,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 20:55:41,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25] total 51 [2023-11-22 20:55:41,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427302369] [2023-11-22 20:55:41,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 20:55:41,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-22 20:55:41,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:41,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-22 20:55:41,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=3127, Unknown=26, NotChecked=0, Total=3306 [2023-11-22 20:55:41,909 INFO L87 Difference]: Start difference. First operand 200 states and 267 transitions. Second operand has 52 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 36 states have internal predecessors, (67), 19 states have call successors, (20), 15 states have call predecessors, (20), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 20:55:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:46,615 INFO L93 Difference]: Finished difference Result 530 states and 707 transitions. [2023-11-22 20:55:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-11-22 20:55:46,616 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 36 states have internal predecessors, (67), 19 states have call successors, (20), 15 states have call predecessors, (20), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 57 [2023-11-22 20:55:46,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:46,621 INFO L225 Difference]: With dead ends: 530 [2023-11-22 20:55:46,623 INFO L226 Difference]: Without dead ends: 353 [2023-11-22 20:55:46,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3104 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=910, Invalid=14558, Unknown=32, NotChecked=0, Total=15500 [2023-11-22 20:55:46,634 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 316 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 2763 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:46,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1282 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2763 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-22 20:55:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-11-22 20:55:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 263. [2023-11-22 20:55:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 190 states have (on average 1.2736842105263158) internal successors, (242), 206 states have internal predecessors, (242), 35 states have call successors, (35), 29 states have call predecessors, (35), 37 states have return successors, (80), 29 states have call predecessors, (80), 33 states have call successors, (80) [2023-11-22 20:55:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 357 transitions. [2023-11-22 20:55:46,697 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 357 transitions. Word has length 57 [2023-11-22 20:55:46,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:46,698 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 357 transitions. [2023-11-22 20:55:46,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 36 states have internal predecessors, (67), 19 states have call successors, (20), 15 states have call predecessors, (20), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 20:55:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 357 transitions. [2023-11-22 20:55:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-22 20:55:46,700 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:46,700 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:55:46,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 20:55:46,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:55:46,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:55:46,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:46,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1908661498, now seen corresponding path program 1 times [2023-11-22 20:55:46,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:46,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142172449] [2023-11-22 20:55:46,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 20:55:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:55:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:55:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:48,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 20:55:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 20:55:49,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:49,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142172449] [2023-11-22 20:55:49,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142172449] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:55:49,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199678521] [2023-11-22 20:55:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:49,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:55:49,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:55:49,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 20:55:49,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 20:55:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:49,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 175 conjunts are in the unsatisfiable core [2023-11-22 20:55:49,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:55:49,279 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 26 treesize of output 24 [2023-11-22 20:55:49,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-22 20:55:49,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-22 20:55:49,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-22 20:55:49,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 20:55:49,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 20:55:49,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 18 treesize of output 13 [2023-11-22 20:55:51,891 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (let ((.cse2 (store |v_#memory_int_BEFORE_CALL_34| .cse1 (select |c_#memory_int| .cse1)))) (let ((.cse0 (@diff .cse2 |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_12_to_13_0_~d.base) (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse1 c_func_to_recursive_line_12_to_13_0_~e.base) (= (store .cse2 .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))))) (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse3 c_func_to_recursive_line_12_to_13_0_~e.base) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_34| .cse3 (select |c_#memory_int| .cse3)))))) (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset) 4294967295) (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse4 c_func_to_recursive_line_12_to_13_0_~e.base) (= (@diff (store |v_#memory_int_BEFORE_CALL_34| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) c_func_to_recursive_line_12_to_13_0_~e.base))))) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~e.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~d.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base))) is different from false [2023-11-22 20:55:51,984 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (let ((.cse2 (store |v_#memory_int_BEFORE_CALL_34| .cse1 (select |c_#memory_int| .cse1)))) (let ((.cse0 (@diff .cse2 |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_12_to_13_0_~d.base) (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse1 c_func_to_recursive_line_12_to_13_0_~e.base) (= (store .cse2 .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))))) (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse3 c_func_to_recursive_line_12_to_13_0_~e.base) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_34| .cse3 (select |c_#memory_int| .cse3)))))) (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset) 4294967295) (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse4 c_func_to_recursive_line_12_to_13_0_~e.base) (= (@diff (store |v_#memory_int_BEFORE_CALL_34| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) c_func_to_recursive_line_12_to_13_0_~e.base))))) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~e.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~d.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base))) is different from true [2023-11-22 20:55:52,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 20:55:52,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 20:55:52,277 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 19 treesize of output 18 [2023-11-22 20:55:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 20:55:52,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 20:55:52,833 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (not (= (mod (+ (select (select (let ((.cse0 (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~d.base v_ArrVal_436))) (store .cse0 c_func_to_recursive_line_12_to_13_0_~e.base (store (select .cse0 c_func_to_recursive_line_12_to_13_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 0))) c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset) 4294967294) 4294967296) 0))) is different from false [2023-11-22 20:55:52,998 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (not (= (mod (+ 4294967294 (select (select (let ((.cse0 (store (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~c.base v_ArrVal_435) c_func_to_recursive_line_12_to_13_0_~d.base v_ArrVal_436))) (store .cse0 c_func_to_recursive_line_12_to_13_0_~e.base (store (select .cse0 c_func_to_recursive_line_12_to_13_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 0))) c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) 4294967296) 0))) is different from false [2023-11-22 20:55:53,093 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (not (= (mod (+ (select (select (store (store (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~c.base v_ArrVal_435) c_func_to_recursive_line_12_to_13_0_~d.base v_ArrVal_436) c_func_to_recursive_line_12_to_13_0_~e.base (store (select (store (store (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~e.base v_ArrVal_446) c_func_to_recursive_line_12_to_13_0_~c.base v_ArrVal_435) c_func_to_recursive_line_12_to_13_0_~d.base v_ArrVal_436) c_func_to_recursive_line_12_to_13_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 0)) c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset) 4294967294) 4294967296) 0))) is different from false [2023-11-22 20:55:53,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199678521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:55:53,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 20:55:53,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 50 [2023-11-22 20:55:53,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466293109] [2023-11-22 20:55:53,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 20:55:53,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-22 20:55:53,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:55:53,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-22 20:55:53,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3010, Unknown=27, NotChecked=452, Total=3660 [2023-11-22 20:55:53,099 INFO L87 Difference]: Start difference. First operand 263 states and 357 transitions. Second operand has 51 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 36 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 20:55:54,907 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset) 4294967295))) (and (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~b.base) c_func_to_recursive_line_12_to_13_0_~b.offset) 0) (not (= c_func_to_recursive_line_12_to_13_0_~d.base c_func_to_recursive_line_12_to_13_0_~b.base)) (or (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (let ((.cse2 (store |v_#memory_int_BEFORE_CALL_34| .cse1 (select |c_#memory_int| .cse1)))) (let ((.cse0 (@diff .cse2 |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_12_to_13_0_~d.base) (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse1 c_func_to_recursive_line_12_to_13_0_~e.base) (= (store .cse2 .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))))) (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse3 c_func_to_recursive_line_12_to_13_0_~e.base) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_34| .cse3 (select |c_#memory_int| .cse3)))))) .cse4 (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse5 c_func_to_recursive_line_12_to_13_0_~e.base) (= (@diff (store |v_#memory_int_BEFORE_CALL_34| .cse5 (select |c_#memory_int| .cse5)) |c_#memory_int|) c_func_to_recursive_line_12_to_13_0_~e.base))))) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~e.base)) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~e.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~b.base)) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~d.base)) (not (= c_func_to_recursive_line_12_to_13_0_~b.base c_func_to_recursive_line_12_to_13_0_~e.base)) (not (= c_func_to_recursive_line_12_to_13_0_~d.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) .cse4 (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~c.base) c_func_to_recursive_line_12_to_13_0_~c.offset) 0))) is different from false [2023-11-22 20:55:54,914 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset) 4294967295))) (and (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~b.base) c_func_to_recursive_line_12_to_13_0_~b.offset) 0) (not (= c_func_to_recursive_line_12_to_13_0_~d.base c_func_to_recursive_line_12_to_13_0_~b.base)) (or (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (let ((.cse2 (store |v_#memory_int_BEFORE_CALL_34| .cse1 (select |c_#memory_int| .cse1)))) (let ((.cse0 (@diff .cse2 |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_12_to_13_0_~d.base) (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse1 c_func_to_recursive_line_12_to_13_0_~e.base) (= (store .cse2 .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))))) (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse3 c_func_to_recursive_line_12_to_13_0_~e.base) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_34| .cse3 (select |c_#memory_int| .cse3)))))) .cse4 (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse5 c_func_to_recursive_line_12_to_13_0_~e.base) (= (@diff (store |v_#memory_int_BEFORE_CALL_34| .cse5 (select |c_#memory_int| .cse5)) |c_#memory_int|) c_func_to_recursive_line_12_to_13_0_~e.base))))) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~e.base)) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~e.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~b.base)) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~d.base)) (not (= c_func_to_recursive_line_12_to_13_0_~b.base c_func_to_recursive_line_12_to_13_0_~e.base)) (not (= c_func_to_recursive_line_12_to_13_0_~d.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) .cse4 (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~c.base) c_func_to_recursive_line_12_to_13_0_~c.offset) 0))) is different from true [2023-11-22 20:55:57,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:55:57,167 INFO L93 Difference]: Finished difference Result 611 states and 819 transitions. [2023-11-22 20:55:57,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-22 20:55:57,168 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 36 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Word has length 59 [2023-11-22 20:55:57,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:55:57,170 INFO L225 Difference]: With dead ends: 611 [2023-11-22 20:55:57,170 INFO L226 Difference]: Without dead ends: 425 [2023-11-22 20:55:57,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2729 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=949, Invalid=13084, Unknown=29, NotChecked=1190, Total=15252 [2023-11-22 20:55:57,178 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 297 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-22 20:55:57,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1035 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2139 Invalid, 0 Unknown, 280 Unchecked, 1.2s Time] [2023-11-22 20:55:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2023-11-22 20:55:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 323. [2023-11-22 20:55:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 227 states have (on average 1.277533039647577) internal successors, (290), 250 states have internal predecessors, (290), 45 states have call successors, (45), 39 states have call predecessors, (45), 50 states have return successors, (109), 35 states have call predecessors, (109), 43 states have call successors, (109) [2023-11-22 20:55:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 444 transitions. [2023-11-22 20:55:57,237 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 444 transitions. Word has length 59 [2023-11-22 20:55:57,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:55:57,242 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 444 transitions. [2023-11-22 20:55:57,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 36 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 20:55:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 444 transitions. [2023-11-22 20:55:57,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-22 20:55:57,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:55:57,244 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:55:57,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-22 20:55:57,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:55:57,445 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:55:57,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:55:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1753822486, now seen corresponding path program 3 times [2023-11-22 20:55:57,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:55:57,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303763585] [2023-11-22 20:55:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:55:57,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:55:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:59,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:55:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:59,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:55:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:55:59,669 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-22 20:55:59,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:55:59,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303763585] [2023-11-22 20:55:59,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303763585] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:55:59,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703391182] [2023-11-22 20:55:59,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 20:55:59,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:55:59,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:55:59,671 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 20:55:59,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-22 20:55:59,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-22 20:55:59,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 20:55:59,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 169 conjunts are in the unsatisfiable core [2023-11-22 20:55:59,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:55:59,995 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 20:55:59,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-11-22 20:56:00,660 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 20:56:00,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-11-22 20:56:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 20:56:00,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 20:56:01,038 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_518 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base v_ArrVal_518))) (= (mod (select (select .cse0 c_func_to_recursive_line_14_to_16_0_~b.base) c_func_to_recursive_line_14_to_16_0_~b.offset) 4294967296) (mod (select (select .cse0 c_func_to_recursive_line_14_to_16_0_~a.base) c_func_to_recursive_line_14_to_16_0_~a.offset) 4294967296))))) is different from false [2023-11-22 20:56:01,172 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-22 20:56:01,173 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 102 treesize of output 85 [2023-11-22 20:56:01,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 20:56:01,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 57 [2023-11-22 20:56:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 20:56:01,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703391182] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 20:56:01,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 20:56:01,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 54 [2023-11-22 20:56:01,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318410940] [2023-11-22 20:56:01,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 20:56:01,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-22 20:56:01,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:56:01,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-22 20:56:01,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2610, Unknown=18, NotChecked=102, Total=2862 [2023-11-22 20:56:01,930 INFO L87 Difference]: Start difference. First operand 323 states and 444 transitions. Second operand has 54 states, 46 states have (on average 2.282608695652174) internal successors, (105), 37 states have internal predecessors, (105), 20 states have call successors, (26), 19 states have call predecessors, (26), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-22 20:56:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:56:06,238 INFO L93 Difference]: Finished difference Result 718 states and 1053 transitions. [2023-11-22 20:56:06,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-22 20:56:06,239 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 46 states have (on average 2.282608695652174) internal successors, (105), 37 states have internal predecessors, (105), 20 states have call successors, (26), 19 states have call predecessors, (26), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 60 [2023-11-22 20:56:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:56:06,243 INFO L225 Difference]: With dead ends: 718 [2023-11-22 20:56:06,243 INFO L226 Difference]: Without dead ends: 411 [2023-11-22 20:56:06,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=583, Invalid=8332, Unknown=19, NotChecked=186, Total=9120 [2023-11-22 20:56:06,247 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 231 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-22 20:56:06,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 837 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1760 Invalid, 0 Unknown, 95 Unchecked, 1.3s Time] [2023-11-22 20:56:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-11-22 20:56:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 380. [2023-11-22 20:56:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 272 states have (on average 1.2463235294117647) internal successors, (339), 299 states have internal predecessors, (339), 49 states have call successors, (49), 43 states have call predecessors, (49), 58 states have return successors, (140), 39 states have call predecessors, (140), 47 states have call successors, (140) [2023-11-22 20:56:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 528 transitions. [2023-11-22 20:56:06,305 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 528 transitions. Word has length 60 [2023-11-22 20:56:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:56:06,305 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 528 transitions. [2023-11-22 20:56:06,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 46 states have (on average 2.282608695652174) internal successors, (105), 37 states have internal predecessors, (105), 20 states have call successors, (26), 19 states have call predecessors, (26), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-22 20:56:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 528 transitions. [2023-11-22 20:56:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-22 20:56:06,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:56:06,307 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:56:06,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-22 20:56:06,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-22 20:56:06,519 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:56:06,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:56:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1057413923, now seen corresponding path program 4 times [2023-11-22 20:56:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:56:06,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480116742] [2023-11-22 20:56:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:56:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:56:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:56:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:08,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:56:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:08,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:56:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 62 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-22 20:56:08,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:56:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480116742] [2023-11-22 20:56:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480116742] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:56:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460646041] [2023-11-22 20:56:08,967 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 20:56:08,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:56:08,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:56:08,969 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 20:56:09,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-22 20:56:09,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 20:56:09,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 20:56:09,224 WARN L260 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 398 conjunts are in the unsatisfiable core [2023-11-22 20:56:09,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:56:09,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-22 20:56:09,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2023-11-22 20:56:09,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-22 20:56:09,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 20:56:09,261 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 1 [2023-11-22 20:56:09,271 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-22 20:56:09,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 53 [2023-11-22 20:56:09,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-22 20:56:09,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-22 20:56:10,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-22 20:56:10,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-11-22 20:56:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-22 20:56:11,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 20:56:14,355 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 (Array Int Int))) (not (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~d.base v_ArrVal_609))) (store .cse1 c_func_to_recursive_line_13_to_14_0_~e.base (store (select .cse1 c_func_to_recursive_line_13_to_14_0_~e.base) c_func_to_recursive_line_13_to_14_0_~e.offset 1))))) (= (mod (select (select .cse0 c_func_to_recursive_line_13_to_14_0_~b.base) c_func_to_recursive_line_13_to_14_0_~b.offset) 4294967296) (mod (select (select .cse0 c_func_to_recursive_line_13_to_14_0_~a.base) c_func_to_recursive_line_13_to_14_0_~a.offset) 4294967296))))) is different from false [2023-11-22 20:56:14,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460646041] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:56:14,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 20:56:14,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2023-11-22 20:56:14,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305751732] [2023-11-22 20:56:14,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 20:56:14,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-22 20:56:14,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:56:14,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-22 20:56:14,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2817, Unknown=12, NotChecked=106, Total=3080 [2023-11-22 20:56:14,958 INFO L87 Difference]: Start difference. First operand 380 states and 528 transitions. Second operand has 45 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 36 states have internal predecessors, (90), 15 states have call successors, (17), 10 states have call predecessors, (17), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 20:56:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:56:18,989 INFO L93 Difference]: Finished difference Result 756 states and 1103 transitions. [2023-11-22 20:56:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-22 20:56:18,990 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 36 states have internal predecessors, (90), 15 states have call successors, (17), 10 states have call predecessors, (17), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2023-11-22 20:56:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:56:18,993 INFO L225 Difference]: With dead ends: 756 [2023-11-22 20:56:18,993 INFO L226 Difference]: Without dead ends: 392 [2023-11-22 20:56:18,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=333, Invalid=5821, Unknown=12, NotChecked=154, Total=6320 [2023-11-22 20:56:18,995 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 66 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-22 20:56:18,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 834 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-22 20:56:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-22 20:56:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 384. [2023-11-22 20:56:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 274 states have (on average 1.2445255474452555) internal successors, (341), 301 states have internal predecessors, (341), 49 states have call successors, (49), 43 states have call predecessors, (49), 60 states have return successors, (170), 41 states have call predecessors, (170), 47 states have call successors, (170) [2023-11-22 20:56:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 560 transitions. [2023-11-22 20:56:19,060 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 560 transitions. Word has length 74 [2023-11-22 20:56:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:56:19,061 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 560 transitions. [2023-11-22 20:56:19,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 36 states have internal predecessors, (90), 15 states have call successors, (17), 10 states have call predecessors, (17), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 20:56:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 560 transitions. [2023-11-22 20:56:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-22 20:56:19,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:56:19,062 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:56:19,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-22 20:56:19,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:56:19,278 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:56:19,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:56:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2028344313, now seen corresponding path program 1 times [2023-11-22 20:56:19,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:56:19,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747288467] [2023-11-22 20:56:19,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:56:19,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:56:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 4 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 20:56:21,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:56:21,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747288467] [2023-11-22 20:56:21,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747288467] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:56:21,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190531113] [2023-11-22 20:56:21,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:56:21,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:56:21,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:56:21,243 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 20:56:21,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-22 20:56:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:56:21,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 267 conjunts are in the unsatisfiable core [2023-11-22 20:56:21,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:56:21,557 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 20:56:21,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2023-11-22 20:56:21,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-22 20:56:21,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 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-22 20:56:21,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-22 20:56:21,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-22 20:56:22,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-22 20:56:22,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-22 20:56:22,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-22 20:56:22,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-22 20:56:22,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-22 20:56:23,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-22 20:56:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 4 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 20:56:23,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 20:56:26,265 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int) (func_to_recursive_line_12_to_13_0_~d.offset Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_func_to_recursive_line_11_to_12_0_#in~c.base| v_ArrVal_692))) (store .cse2 |c_func_to_recursive_line_11_to_12_0_#in~d.base| (store (select .cse2 |c_func_to_recursive_line_11_to_12_0_#in~d.base|) func_to_recursive_line_12_to_13_0_~d.offset 0))))) (store .cse1 |c_func_to_recursive_line_11_to_12_0_#in~e.base| (store (select .cse1 |c_func_to_recursive_line_11_to_12_0_#in~e.base|) func_to_recursive_line_13_to_14_0_~e.offset 4))))) (or (not (= 4 (mod (select (select .cse0 |c_func_to_recursive_line_11_to_12_0_#in~d.base|) func_to_recursive_line_12_to_13_0_~d.offset) 4294967296))) (not (= (mod (+ 4294967294 (select (select .cse0 |c_func_to_recursive_line_11_to_12_0_#in~uint32_max.base|) |c_func_to_recursive_line_11_to_12_0_#in~uint32_max.offset|)) 4294967296) 4))))) is different from false [2023-11-22 20:56:26,289 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int) (func_to_recursive_line_12_to_13_0_~d.offset Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| c_func_to_recursive_line_10_to_11_0_~c.base v_ArrVal_692))) (store .cse2 c_func_to_recursive_line_10_to_11_0_~d.base (store (select .cse2 c_func_to_recursive_line_10_to_11_0_~d.base) func_to_recursive_line_12_to_13_0_~d.offset 0))))) (store .cse1 c_func_to_recursive_line_10_to_11_0_~e.base (store (select .cse1 c_func_to_recursive_line_10_to_11_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 4))))) (or (not (= (mod (+ 4294967294 (select (select .cse0 c_func_to_recursive_line_10_to_11_0_~uint32_max.base) c_func_to_recursive_line_10_to_11_0_~uint32_max.offset)) 4294967296) 4)) (not (= (mod (select (select .cse0 c_func_to_recursive_line_10_to_11_0_~d.base) func_to_recursive_line_12_to_13_0_~d.offset) 4294967296) 4))))) is different from false [2023-11-22 20:56:26,304 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int) (func_to_recursive_line_12_to_13_0_~d.offset Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| c_func_to_recursive_line_10_to_11_0_~b.base v_ArrVal_691) c_func_to_recursive_line_10_to_11_0_~c.base v_ArrVal_692))) (store .cse2 c_func_to_recursive_line_10_to_11_0_~d.base (store (select .cse2 c_func_to_recursive_line_10_to_11_0_~d.base) func_to_recursive_line_12_to_13_0_~d.offset 0))))) (store .cse1 c_func_to_recursive_line_10_to_11_0_~e.base (store (select .cse1 c_func_to_recursive_line_10_to_11_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 4))))) (or (not (= (mod (+ 4294967294 (select (select .cse0 c_func_to_recursive_line_10_to_11_0_~uint32_max.base) c_func_to_recursive_line_10_to_11_0_~uint32_max.offset)) 4294967296) 4)) (not (= (mod (select (select .cse0 c_func_to_recursive_line_10_to_11_0_~d.base) func_to_recursive_line_12_to_13_0_~d.offset) 4294967296) 4))))) is different from false [2023-11-22 20:56:26,326 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int) (func_to_recursive_line_12_to_13_0_~d.offset Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_func_to_recursive_line_10_to_11_0_#in~b.base| v_ArrVal_691) |c_func_to_recursive_line_10_to_11_0_#in~c.base| v_ArrVal_692))) (store .cse2 |c_func_to_recursive_line_10_to_11_0_#in~d.base| (store (select .cse2 |c_func_to_recursive_line_10_to_11_0_#in~d.base|) func_to_recursive_line_12_to_13_0_~d.offset 0))))) (store .cse1 |c_func_to_recursive_line_10_to_11_0_#in~e.base| (store (select .cse1 |c_func_to_recursive_line_10_to_11_0_#in~e.base|) func_to_recursive_line_13_to_14_0_~e.offset 4))))) (or (not (= 4 (mod (+ 4294967294 (select (select .cse0 |c_func_to_recursive_line_10_to_11_0_#in~uint32_max.base|) |c_func_to_recursive_line_10_to_11_0_#in~uint32_max.offset|)) 4294967296))) (not (= (mod (select (select .cse0 |c_func_to_recursive_line_10_to_11_0_#in~d.base|) func_to_recursive_line_12_to_13_0_~d.offset) 4294967296) 4))))) is different from false [2023-11-22 20:56:26,341 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int) (func_to_recursive_line_12_to_13_0_~d.offset Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_691) |c_ULTIMATE.start_main_~#c~0#1.base| v_ArrVal_692))) (store .cse2 |c_ULTIMATE.start_main_~#d~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#d~0#1.base|) func_to_recursive_line_12_to_13_0_~d.offset 0))))) (store .cse1 |c_ULTIMATE.start_main_~#e~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#e~0#1.base|) func_to_recursive_line_13_to_14_0_~e.offset 4))))) (or (not (= (mod (+ (select (select .cse0 |c_ULTIMATE.start_main_~#uint32_max~0#1.base|) |c_ULTIMATE.start_main_~#uint32_max~0#1.offset|) 4294967294) 4294967296) 4)) (not (= (mod (select (select .cse0 |c_ULTIMATE.start_main_~#d~0#1.base|) func_to_recursive_line_12_to_13_0_~d.offset) 4294967296) 4))))) is different from false [2023-11-22 20:56:26,343 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 20:56:26,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190531113] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 20:56:26,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 20:56:26,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 27] total 81 [2023-11-22 20:56:26,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551534616] [2023-11-22 20:56:26,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 20:56:26,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2023-11-22 20:56:26,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:56:26,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2023-11-22 20:56:26,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=5456, Unknown=29, NotChecked=770, Total=6642 [2023-11-22 20:56:26,359 INFO L87 Difference]: Start difference. First operand 384 states and 560 transitions. Second operand has 82 states, 68 states have (on average 2.7794117647058822) internal successors, (189), 54 states have internal predecessors, (189), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 20:57:54,149 WARN L293 SmtUtils]: Spent 30.28s on a formula simplification that was a NOOP. DAG size: 184 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 20:58:26,343 WARN L293 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 178 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 20:58:27,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 20:58:29,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 20:58:31,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 20:58:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:58:54,515 INFO L93 Difference]: Finished difference Result 1235 states and 1803 transitions. [2023-11-22 20:58:54,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2023-11-22 20:58:54,516 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 68 states have (on average 2.7794117647058822) internal successors, (189), 54 states have internal predecessors, (189), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2023-11-22 20:58:54,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:58:54,521 INFO L225 Difference]: With dead ends: 1235 [2023-11-22 20:58:54,521 INFO L226 Difference]: Without dead ends: 841 [2023-11-22 20:58:54,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 179 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 9435 ImplicationChecksByTransitivity, 131.9s TimeCoverageRelationStatistics Valid=2621, Invalid=28161, Unknown=38, NotChecked=1760, Total=32580 [2023-11-22 20:58:54,526 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 916 mSDsluCounter, 2387 mSDsCounter, 0 mSdLazyCounter, 4307 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 2455 SdHoareTripleChecker+Invalid, 6591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 4307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2126 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2023-11-22 20:58:54,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 2455 Invalid, 6591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 4307 Invalid, 0 Unknown, 2126 Unchecked, 20.0s Time] [2023-11-22 20:58:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2023-11-22 20:58:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 754. [2023-11-22 20:58:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 582 states have (on average 1.2199312714776633) internal successors, (710), 629 states have internal predecessors, (710), 74 states have call successors, (74), 66 states have call predecessors, (74), 97 states have return successors, (276), 60 states have call predecessors, (276), 72 states have call successors, (276) [2023-11-22 20:58:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1060 transitions. [2023-11-22 20:58:54,598 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1060 transitions. Word has length 73 [2023-11-22 20:58:54,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:58:54,599 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 1060 transitions. [2023-11-22 20:58:54,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 68 states have (on average 2.7794117647058822) internal successors, (189), 54 states have internal predecessors, (189), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 20:58:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1060 transitions. [2023-11-22 20:58:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-22 20:58:54,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:58:54,602 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:58:54,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-22 20:58:54,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:58:54,810 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:58:54,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:58:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash 828185712, now seen corresponding path program 5 times [2023-11-22 20:58:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:58:54,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557382962] [2023-11-22 20:58:54,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:58:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:58:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:56,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:58:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:56,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:58:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:56,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:58:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:56,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:58:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 4 proven. 114 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-22 20:58:56,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:58:56,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557382962] [2023-11-22 20:58:56,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557382962] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:58:56,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638026350] [2023-11-22 20:58:56,796 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-22 20:58:56,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:58:56,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:58:56,797 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 20:58:56,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-22 20:58:57,080 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-22 20:58:57,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 20:58:57,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 224 conjunts are in the unsatisfiable core [2023-11-22 20:58:57,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:58:57,096 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 152 treesize of output 148 [2023-11-22 20:58:57,601 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 17 treesize of output 9 [2023-11-22 20:58:57,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-22 20:58:58,041 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 20:58:58,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-11-22 20:58:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 39 proven. 68 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-22 20:58:58,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 20:58:58,352 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base v_ArrVal_791))) (= (mod (select (select .cse0 c_func_to_recursive_line_14_to_16_0_~c.base) c_func_to_recursive_line_14_to_16_0_~c.offset) 4294967296) (mod (select (select .cse0 c_func_to_recursive_line_14_to_16_0_~d.base) c_func_to_recursive_line_14_to_16_0_~d.offset) 4294967296))))) is different from false [2023-11-22 20:58:58,665 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod (select (select |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~c.base|) |c_func_to_recursive_line_14_to_16_0_#in~c.offset|) 4294967296) (mod (select (select |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~d.base|) |c_func_to_recursive_line_14_to_16_0_#in~d.offset|) 4294967296)) (forall ((v_ArrVal_791 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~e.base| v_ArrVal_791))) (= (mod (select (select .cse0 |c_func_to_recursive_line_14_to_16_0_#in~d.base|) |c_func_to_recursive_line_14_to_16_0_#in~d.offset|) 4294967296) (mod (select (select .cse0 |c_func_to_recursive_line_14_to_16_0_#in~c.base|) |c_func_to_recursive_line_14_to_16_0_#in~c.offset|) 4294967296)))))) is different from false [2023-11-22 20:58:58,673 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_791 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base v_ArrVal_791))) (= (mod (select (select .cse0 c_func_to_recursive_line_13_to_14_0_~c.base) c_func_to_recursive_line_13_to_14_0_~c.offset) 4294967296) (mod (select (select .cse0 c_func_to_recursive_line_13_to_14_0_~d.base) c_func_to_recursive_line_13_to_14_0_~d.offset) 4294967296))))) (= (mod (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~c.base) c_func_to_recursive_line_13_to_14_0_~c.offset) 4294967296) (mod (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~d.base) c_func_to_recursive_line_13_to_14_0_~d.offset) 4294967296))) is different from false [2023-11-22 20:58:58,792 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_790 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~e.base| v_ArrVal_790))) (= (mod (select (select .cse0 |c_func_to_recursive_line_13_to_14_0_#in~c.base|) |c_func_to_recursive_line_13_to_14_0_#in~c.offset|) 4294967296) (mod (select (select .cse0 |c_func_to_recursive_line_13_to_14_0_#in~d.base|) |c_func_to_recursive_line_13_to_14_0_#in~d.offset|) 4294967296)))) (forall ((v_ArrVal_791 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~e.base| v_ArrVal_791))) (= (mod (select (select .cse1 |c_func_to_recursive_line_13_to_14_0_#in~c.base|) |c_func_to_recursive_line_13_to_14_0_#in~c.offset|) 4294967296) (mod (select (select .cse1 |c_func_to_recursive_line_13_to_14_0_#in~d.base|) |c_func_to_recursive_line_13_to_14_0_#in~d.offset|) 4294967296)))))) is different from false [2023-11-22 20:58:58,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 20:58:58,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 54 [2023-11-22 20:58:58,811 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-22 20:58:58,812 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 168 treesize of output 136 [2023-11-22 20:58:58,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 20:58:58,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 71 [2023-11-22 20:58:58,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 20:58:58,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 66 [2023-11-22 20:58:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 73 proven. 6 refuted. 1 times theorem prover too weak. 54 trivial. 3 not checked. [2023-11-22 20:58:59,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638026350] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 20:58:59,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 20:58:59,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 23, 23] total 73 [2023-11-22 20:58:59,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410475229] [2023-11-22 20:58:59,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 20:58:59,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-11-22 20:58:59,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:58:59,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-11-22 20:58:59,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=4416, Unknown=90, NotChecked=548, Total=5256 [2023-11-22 20:58:59,582 INFO L87 Difference]: Start difference. First operand 754 states and 1060 transitions. Second operand has 73 states, 64 states have (on average 2.390625) internal successors, (153), 52 states have internal predecessors, (153), 27 states have call successors, (28), 23 states have call predecessors, (28), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-22 20:59:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:59:07,923 INFO L93 Difference]: Finished difference Result 2324 states and 3492 transitions. [2023-11-22 20:59:07,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-11-22 20:59:07,924 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 64 states have (on average 2.390625) internal successors, (153), 52 states have internal predecessors, (153), 27 states have call successors, (28), 23 states have call predecessors, (28), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 88 [2023-11-22 20:59:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:59:07,931 INFO L225 Difference]: With dead ends: 2324 [2023-11-22 20:59:07,931 INFO L226 Difference]: Without dead ends: 1621 [2023-11-22 20:59:07,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 149 SyntacticMatches, 9 SemanticMatches, 145 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4631 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1901, Invalid=18327, Unknown=94, NotChecked=1140, Total=21462 [2023-11-22 20:59:07,935 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 554 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 4475 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 5447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 4475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 823 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-22 20:59:07,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1501 Invalid, 5447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 4475 Invalid, 0 Unknown, 823 Unchecked, 2.5s Time] [2023-11-22 20:59:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2023-11-22 20:59:08,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1364. [2023-11-22 20:59:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1079 states have (on average 1.1881371640407785) internal successors, (1282), 1172 states have internal predecessors, (1282), 125 states have call successors, (125), 103 states have call predecessors, (125), 159 states have return successors, (554), 92 states have call predecessors, (554), 123 states have call successors, (554) [2023-11-22 20:59:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1961 transitions. [2023-11-22 20:59:08,065 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1961 transitions. Word has length 88 [2023-11-22 20:59:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:59:08,066 INFO L495 AbstractCegarLoop]: Abstraction has 1364 states and 1961 transitions. [2023-11-22 20:59:08,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 64 states have (on average 2.390625) internal successors, (153), 52 states have internal predecessors, (153), 27 states have call successors, (28), 23 states have call predecessors, (28), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-22 20:59:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1961 transitions. [2023-11-22 20:59:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-22 20:59:08,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:59:08,068 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:59:08,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-22 20:59:08,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-22 20:59:08,281 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:59:08,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:59:08,282 INFO L85 PathProgramCache]: Analyzing trace with hash -25628422, now seen corresponding path program 1 times [2023-11-22 20:59:08,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:59:08,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063434941] [2023-11-22 20:59:08,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:59:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:59:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:11,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 20:59:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:12,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:59:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:13,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:59:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:13,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:59:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:59:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:13,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:59:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:13,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-22 20:59:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:13,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-22 20:59:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-22 20:59:13,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:59:13,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063434941] [2023-11-22 20:59:13,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063434941] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:59:13,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677785660] [2023-11-22 20:59:13,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:59:13,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:59:13,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:59:13,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 20:59:13,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-22 20:59:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:14,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 256 conjunts are in the unsatisfiable core [2023-11-22 20:59:14,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:59:14,197 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-11-22 20:59:14,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 377 treesize of output 368 [2023-11-22 20:59:14,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-22 20:59:14,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 20:59:14,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-22 20:59:14,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-22 20:59:14,243 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 20:59:14,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-22 20:59:14,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-22 20:59:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 49 proven. 49 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-22 20:59:15,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 20:59:16,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677785660] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:59:16,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 20:59:16,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 23] total 54 [2023-11-22 20:59:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304845553] [2023-11-22 20:59:16,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 20:59:16,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-22 20:59:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:59:16,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-22 20:59:16,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2770, Unknown=3, NotChecked=0, Total=2970 [2023-11-22 20:59:16,633 INFO L87 Difference]: Start difference. First operand 1364 states and 1961 transitions. Second operand has 54 states, 39 states have (on average 3.051282051282051) internal successors, (119), 44 states have internal predecessors, (119), 23 states have call successors, (26), 11 states have call predecessors, (26), 9 states have return successors, (15), 11 states have call predecessors, (15), 14 states have call successors, (15) [2023-11-22 20:59:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:59:20,643 INFO L93 Difference]: Finished difference Result 2467 states and 3772 transitions. [2023-11-22 20:59:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-22 20:59:20,644 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 39 states have (on average 3.051282051282051) internal successors, (119), 44 states have internal predecessors, (119), 23 states have call successors, (26), 11 states have call predecessors, (26), 9 states have return successors, (15), 11 states have call predecessors, (15), 14 states have call successors, (15) Word has length 98 [2023-11-22 20:59:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:59:20,652 INFO L225 Difference]: With dead ends: 2467 [2023-11-22 20:59:20,653 INFO L226 Difference]: Without dead ends: 1480 [2023-11-22 20:59:20,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1571 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=528, Invalid=6923, Unknown=31, NotChecked=0, Total=7482 [2023-11-22 20:59:20,656 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 149 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 86 mSolverCounterUnsat, 44 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 44 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-22 20:59:20,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1364 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2590 Invalid, 44 Unknown, 0 Unchecked, 2.0s Time] [2023-11-22 20:59:20,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2023-11-22 20:59:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1450. [2023-11-22 20:59:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1125 states have (on average 1.184) internal successors, (1332), 1221 states have internal predecessors, (1332), 140 states have call successors, (140), 107 states have call predecessors, (140), 184 states have return successors, (833), 124 states have call predecessors, (833), 137 states have call successors, (833) [2023-11-22 20:59:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2305 transitions. [2023-11-22 20:59:20,810 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2305 transitions. Word has length 98 [2023-11-22 20:59:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:59:20,810 INFO L495 AbstractCegarLoop]: Abstraction has 1450 states and 2305 transitions. [2023-11-22 20:59:20,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 39 states have (on average 3.051282051282051) internal successors, (119), 44 states have internal predecessors, (119), 23 states have call successors, (26), 11 states have call predecessors, (26), 9 states have return successors, (15), 11 states have call predecessors, (15), 14 states have call successors, (15) [2023-11-22 20:59:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2305 transitions. [2023-11-22 20:59:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-22 20:59:20,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:59:20,813 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:59:20,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-22 20:59:21,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-22 20:59:21,027 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:59:21,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:59:21,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1090955550, now seen corresponding path program 6 times [2023-11-22 20:59:21,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:59:21,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878078501] [2023-11-22 20:59:21,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:59:21,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:59:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:22,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:59:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:23,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:59:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:23,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:59:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:23,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 20:59:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:59:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 69 proven. 108 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 20:59:23,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:59:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878078501] [2023-11-22 20:59:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878078501] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:59:23,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741191450] [2023-11-22 20:59:23,439 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-22 20:59:23,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:59:23,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:59:23,440 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 20:59:23,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-22 20:59:23,929 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-22 20:59:23,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 20:59:23,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 210 conjunts are in the unsatisfiable core [2023-11-22 20:59:23,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:59:23,951 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 128 treesize of output 126 [2023-11-22 20:59:24,187 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-22 20:59:24,303 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 19 treesize of output 18 [2023-11-22 20:59:26,735 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_13_to_14_0_~d.offset 0) (or (and (= (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base) 0) 0) (= (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~d.base) 0) 0)) (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_86| |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_13_to_14_0_~e.base) (= (store |v_#memory_int_BEFORE_CALL_86| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (select (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_13_to_14_0_~e.base) 0) 0) (= (select (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_13_to_14_0_~d.base) 0) 0))))) (not (= c_func_to_recursive_line_13_to_14_0_~d.base c_func_to_recursive_line_13_to_14_0_~e.base)) (= c_func_to_recursive_line_13_to_14_0_~e.offset 0)) is different from false [2023-11-22 20:59:26,737 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_13_to_14_0_~d.offset 0) (or (and (= (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base) 0) 0) (= (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~d.base) 0) 0)) (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_86| |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_13_to_14_0_~e.base) (= (store |v_#memory_int_BEFORE_CALL_86| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (select (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_13_to_14_0_~e.base) 0) 0) (= (select (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_13_to_14_0_~d.base) 0) 0))))) (not (= c_func_to_recursive_line_13_to_14_0_~d.base c_func_to_recursive_line_13_to_14_0_~e.base)) (= c_func_to_recursive_line_13_to_14_0_~e.offset 0)) is different from true [2023-11-22 20:59:26,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-22 20:59:28,778 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_13_to_14_0_~d.offset 0) (or (and (= (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base) 0) 0) (= (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~d.base) 0) 1)) (exists ((|v_#memory_int_278| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_278| c_func_to_recursive_line_13_to_14_0_~d.base (let ((.cse0 (select |v_#memory_int_278| c_func_to_recursive_line_13_to_14_0_~d.base))) (store .cse0 0 (+ (select .cse0 0) 1)))) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_86| |v_#memory_int_278|))) (and (= (select (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_13_to_14_0_~e.base) 0) 0) (= (select (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_13_to_14_0_~d.base) 0) 0) (= .cse1 c_func_to_recursive_line_13_to_14_0_~e.base) (= (store |v_#memory_int_BEFORE_CALL_86| .cse1 (select |v_#memory_int_278| .cse1)) |v_#memory_int_278|))))))) (not (= c_func_to_recursive_line_13_to_14_0_~d.base c_func_to_recursive_line_13_to_14_0_~e.base)) (= c_func_to_recursive_line_13_to_14_0_~e.offset 0)) is different from false [2023-11-22 20:59:28,781 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_13_to_14_0_~d.offset 0) (or (and (= (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base) 0) 0) (= (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~d.base) 0) 1)) (exists ((|v_#memory_int_278| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_278| c_func_to_recursive_line_13_to_14_0_~d.base (let ((.cse0 (select |v_#memory_int_278| c_func_to_recursive_line_13_to_14_0_~d.base))) (store .cse0 0 (+ (select .cse0 0) 1)))) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_86| |v_#memory_int_278|))) (and (= (select (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_13_to_14_0_~e.base) 0) 0) (= (select (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_13_to_14_0_~d.base) 0) 0) (= .cse1 c_func_to_recursive_line_13_to_14_0_~e.base) (= (store |v_#memory_int_BEFORE_CALL_86| .cse1 (select |v_#memory_int_278| .cse1)) |v_#memory_int_278|))))))) (not (= c_func_to_recursive_line_13_to_14_0_~d.base c_func_to_recursive_line_13_to_14_0_~e.base)) (= c_func_to_recursive_line_13_to_14_0_~e.offset 0)) is different from true [2023-11-22 20:59:30,826 WARN L854 $PredicateComparison]: unable to prove that (and (or (and (= (select (select |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~d.base|) 0) 1) (= (select (select |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~e.base|) 0) 0)) (exists ((|v_#memory_int_278| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_278| |c_func_to_recursive_line_13_to_14_0_#in~d.base| (let ((.cse0 (select |v_#memory_int_278| |c_func_to_recursive_line_13_to_14_0_#in~d.base|))) (store .cse0 0 (+ (select .cse0 0) 1)))) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_86| |v_#memory_int_278|))) (and (= .cse1 |c_func_to_recursive_line_13_to_14_0_#in~e.base|) (= (select (select |v_#memory_int_BEFORE_CALL_86| |c_func_to_recursive_line_13_to_14_0_#in~e.base|) 0) 0) (= (store |v_#memory_int_BEFORE_CALL_86| .cse1 (select |v_#memory_int_278| .cse1)) |v_#memory_int_278|) (= (select (select |v_#memory_int_BEFORE_CALL_86| |c_func_to_recursive_line_13_to_14_0_#in~d.base|) 0) 0))))))) (= |c_func_to_recursive_line_13_to_14_0_#in~d.offset| 0) (= |c_func_to_recursive_line_13_to_14_0_#in~e.offset| 0) (not (= |c_func_to_recursive_line_13_to_14_0_#in~e.base| |c_func_to_recursive_line_13_to_14_0_#in~d.base|))) is different from false [2023-11-22 20:59:30,829 WARN L876 $PredicateComparison]: unable to prove that (and (or (and (= (select (select |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~d.base|) 0) 1) (= (select (select |c_#memory_int| |c_func_to_recursive_line_13_to_14_0_#in~e.base|) 0) 0)) (exists ((|v_#memory_int_278| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_278| |c_func_to_recursive_line_13_to_14_0_#in~d.base| (let ((.cse0 (select |v_#memory_int_278| |c_func_to_recursive_line_13_to_14_0_#in~d.base|))) (store .cse0 0 (+ (select .cse0 0) 1)))) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_86| |v_#memory_int_278|))) (and (= .cse1 |c_func_to_recursive_line_13_to_14_0_#in~e.base|) (= (select (select |v_#memory_int_BEFORE_CALL_86| |c_func_to_recursive_line_13_to_14_0_#in~e.base|) 0) 0) (= (store |v_#memory_int_BEFORE_CALL_86| .cse1 (select |v_#memory_int_278| .cse1)) |v_#memory_int_278|) (= (select (select |v_#memory_int_BEFORE_CALL_86| |c_func_to_recursive_line_13_to_14_0_#in~d.base|) 0) 0))))))) (= |c_func_to_recursive_line_13_to_14_0_#in~d.offset| 0) (= |c_func_to_recursive_line_13_to_14_0_#in~e.offset| 0) (not (= |c_func_to_recursive_line_13_to_14_0_#in~e.base| |c_func_to_recursive_line_13_to_14_0_#in~d.base|))) is different from true [2023-11-22 20:59:30,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-22 20:59:30,902 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_13_to_14_0_~d.offset 0) (or (and (= (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base) 0) 0) (= (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~d.base) 0) 1)) (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int))) (|v_#memory_int_278| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_86| |v_#memory_int_278|))) (and (= (select (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_13_to_14_0_~e.base) 0) 0) (= (select (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_13_to_14_0_~d.base) 0) 0) (= .cse0 c_func_to_recursive_line_13_to_14_0_~e.base) (= (let ((.cse1 (store |v_#memory_int_278| c_func_to_recursive_line_13_to_14_0_~d.base (let ((.cse2 (select |v_#memory_int_278| c_func_to_recursive_line_13_to_14_0_~d.base))) (store .cse2 0 (+ (select .cse2 0) 1)))))) (store .cse1 c_func_to_recursive_line_13_to_14_0_~e.base (store (select .cse1 c_func_to_recursive_line_13_to_14_0_~e.base) 0 0))) |c_#memory_int|) (= (store |v_#memory_int_BEFORE_CALL_86| .cse0 (select |v_#memory_int_278| .cse0)) |v_#memory_int_278|))))) (not (= c_func_to_recursive_line_13_to_14_0_~d.base c_func_to_recursive_line_13_to_14_0_~e.base)) (= c_func_to_recursive_line_13_to_14_0_~e.offset 0)) is different from false [2023-11-22 20:59:30,904 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_13_to_14_0_~d.offset 0) (or (and (= (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~e.base) 0) 0) (= (select (select |c_#memory_int| c_func_to_recursive_line_13_to_14_0_~d.base) 0) 1)) (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int))) (|v_#memory_int_278| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_86| |v_#memory_int_278|))) (and (= (select (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_13_to_14_0_~e.base) 0) 0) (= (select (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_13_to_14_0_~d.base) 0) 0) (= .cse0 c_func_to_recursive_line_13_to_14_0_~e.base) (= (let ((.cse1 (store |v_#memory_int_278| c_func_to_recursive_line_13_to_14_0_~d.base (let ((.cse2 (select |v_#memory_int_278| c_func_to_recursive_line_13_to_14_0_~d.base))) (store .cse2 0 (+ (select .cse2 0) 1)))))) (store .cse1 c_func_to_recursive_line_13_to_14_0_~e.base (store (select .cse1 c_func_to_recursive_line_13_to_14_0_~e.base) 0 0))) |c_#memory_int|) (= (store |v_#memory_int_BEFORE_CALL_86| .cse0 (select |v_#memory_int_278| .cse0)) |v_#memory_int_278|))))) (not (= c_func_to_recursive_line_13_to_14_0_~d.base c_func_to_recursive_line_13_to_14_0_~e.base)) (= c_func_to_recursive_line_13_to_14_0_~e.offset 0)) is different from true [2023-11-22 20:59:31,125 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-11-22 20:59:31,126 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 26 treesize of output 25 [2023-11-22 20:59:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 63 proven. 114 refuted. 0 times theorem prover too weak. 17 trivial. 3 not checked. [2023-11-22 20:59:31,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 20:59:32,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741191450] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:59:32,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 20:59:32,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 54 [2023-11-22 20:59:32,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737702520] [2023-11-22 20:59:32,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 20:59:32,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-22 20:59:32,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:59:32,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-22 20:59:32,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3591, Unknown=9, NotChecked=492, Total=4290 [2023-11-22 20:59:32,159 INFO L87 Difference]: Start difference. First operand 1450 states and 2305 transitions. Second operand has 55 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 39 states have internal predecessors, (124), 20 states have call successors, (21), 16 states have call predecessors, (21), 4 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Killed by 15