./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9948dbd77aeb2de72e0bd3a3a4e22b1606b19383e4631af58adbec46ed909b6c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:36:14,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:36:14,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-10 18:36:14,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:36:14,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:36:14,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:36:14,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:36:14,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:36:14,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:36:14,993 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:36:14,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:36:14,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:36:14,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:36:14,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:36:14,998 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:36:14,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:36:14,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:36:14,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:36:14,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:36:14,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:36:15,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:36:15,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:36:15,004 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:36:15,004 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:36:15,004 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:36:15,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:36:15,004 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:36:15,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:36:15,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:36:15,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:36:15,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:36:15,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:36:15,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:36:15,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:36:15,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:36:15,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:36:15,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:36:15,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:36:15,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:36:15,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:36:15,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:36:15,010 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9948dbd77aeb2de72e0bd3a3a4e22b1606b19383e4631af58adbec46ed909b6c [2024-11-10 18:36:15,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:36:15,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:36:15,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:36:15,325 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:36:15,326 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:36:15,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2024-11-10 18:36:16,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:36:17,199 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:36:17,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2024-11-10 18:36:17,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b566e41b4/97fa4607cd77445eb2e61b24f73ad9c6/FLAGc3acd26ef [2024-11-10 18:36:17,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b566e41b4/97fa4607cd77445eb2e61b24f73ad9c6 [2024-11-10 18:36:17,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:36:17,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:36:17,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:36:17,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:36:17,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:36:17,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e706ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17, skipping insertion in model container [2024-11-10 18:36:17,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:36:17,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:36:17,857 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:36:17,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:36:17,886 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:36:17,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17 WrapperNode [2024-11-10 18:36:17,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:36:17,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:36:17,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:36:17,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:36:17,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,926 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9 [2024-11-10 18:36:17,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:36:17,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:36:17,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:36:17,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:36:17,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,945 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 18:36:17,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:36:17,959 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:36:17,959 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:36:17,959 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:36:17,960 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17" (1/1) ... [2024-11-10 18:36:17,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:36:17,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:36:18,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:36:18,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:36:18,052 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2024-11-10 18:36:18,053 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2024-11-10 18:36:18,053 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2024-11-10 18:36:18,053 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2024-11-10 18:36:18,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:36:18,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:36:18,116 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:36:18,118 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:36:18,209 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L14: havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; [2024-11-10 18:36:18,231 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: havoc #t~ret3;havoc #t~ret4; [2024-11-10 18:36:18,252 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 18:36:18,253 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:36:18,267 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:36:18,268 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:36:18,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:36:18 BoogieIcfgContainer [2024-11-10 18:36:18,268 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:36:18,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:36:18,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:36:18,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:36:18,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:36:17" (1/3) ... [2024-11-10 18:36:18,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b70f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:36:18, skipping insertion in model container [2024-11-10 18:36:18,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:36:17" (2/3) ... [2024-11-10 18:36:18,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b70f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:36:18, skipping insertion in model container [2024-11-10 18:36:18,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:36:18" (3/3) ... [2024-11-10 18:36:18,282 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b.c [2024-11-10 18:36:18,299 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:36:18,299 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-10 18:36:18,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:36:18,366 INFO L333 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, 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;@32b518a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:36:18,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-10 18:36:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 38 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:36:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 18:36:18,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:18,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 18:36:18,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:18,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2047196660, now seen corresponding path program 1 times [2024-11-10 18:36:18,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:18,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560671321] [2024-11-10 18:36:18,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:36:18,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:18,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560671321] [2024-11-10 18:36:18,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560671321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:18,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:18,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:36:18,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357737393] [2024-11-10 18:36:18,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:18,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:36:18,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:18,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:36:18,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:36:18,627 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 38 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:36:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:18,681 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-10 18:36:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:36:18,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 18:36:18,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:18,694 INFO L225 Difference]: With dead ends: 49 [2024-11-10 18:36:18,695 INFO L226 Difference]: Without dead ends: 44 [2024-11-10 18:36:18,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:36:18,702 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 10 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:18,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 88 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-10 18:36:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-11-10 18:36:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 34 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 18:36:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-10 18:36:18,753 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 6 [2024-11-10 18:36:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:18,754 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-10 18:36:18,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:36:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-10 18:36:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 18:36:18,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:18,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:18,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:36:18,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:18,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:18,758 INFO L85 PathProgramCache]: Analyzing trace with hash 961412984, now seen corresponding path program 1 times [2024-11-10 18:36:18,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:18,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360055519] [2024-11-10 18:36:18,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:18,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:36:18,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:18,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360055519] [2024-11-10 18:36:18,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360055519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:18,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:18,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:36:18,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426505010] [2024-11-10 18:36:18,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:18,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:36:18,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:18,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:36:18,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:36:18,868 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:36:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:18,978 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2024-11-10 18:36:18,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:36:18,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 18:36:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:18,980 INFO L225 Difference]: With dead ends: 60 [2024-11-10 18:36:18,981 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 18:36:18,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:36:18,983 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:18,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 168 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:36:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 18:36:19,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-11-10 18:36:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 18:36:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2024-11-10 18:36:19,007 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 7 [2024-11-10 18:36:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:19,007 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-10 18:36:19,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:36:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-11-10 18:36:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 18:36:19,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:19,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:19,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:36:19,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:19,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash -623036941, now seen corresponding path program 1 times [2024-11-10 18:36:19,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:19,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6577105] [2024-11-10 18:36:19,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:36:19,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6577105] [2024-11-10 18:36:19,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6577105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:19,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:19,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:36:19,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693170079] [2024-11-10 18:36:19,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:19,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:36:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:19,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:36:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:36:19,064 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:36:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:19,089 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-11-10 18:36:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:36:19,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 18:36:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:19,093 INFO L225 Difference]: With dead ends: 54 [2024-11-10 18:36:19,094 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 18:36:19,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:36:19,099 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 15 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:19,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 74 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:19,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 18:36:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-11-10 18:36:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 40 states have internal predecessors, (44), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 18:36:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2024-11-10 18:36:19,113 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 11 [2024-11-10 18:36:19,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:19,114 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2024-11-10 18:36:19,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:36:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2024-11-10 18:36:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 18:36:19,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:19,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:19,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:36:19,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:19,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2134276001, now seen corresponding path program 1 times [2024-11-10 18:36:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:19,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449210745] [2024-11-10 18:36:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:36:19,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:19,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449210745] [2024-11-10 18:36:19,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449210745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:19,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:19,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:36:19,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136706526] [2024-11-10 18:36:19,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:19,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:36:19,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:19,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:36:19,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:36:19,222 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:36:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:19,406 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2024-11-10 18:36:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:36:19,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-10 18:36:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:19,409 INFO L225 Difference]: With dead ends: 77 [2024-11-10 18:36:19,409 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 18:36:19,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:36:19,411 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 46 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:19,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 212 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:36:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 18:36:19,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2024-11-10 18:36:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 53 states have internal predecessors, (62), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 18:36:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2024-11-10 18:36:19,447 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 12 [2024-11-10 18:36:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:19,448 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2024-11-10 18:36:19,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:36:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2024-11-10 18:36:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:36:19,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:19,449 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:19,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:36:19,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:19,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash -407566475, now seen corresponding path program 1 times [2024-11-10 18:36:19,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:19,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806355778] [2024-11-10 18:36:19,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:19,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 18:36:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:36:19,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:19,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806355778] [2024-11-10 18:36:19,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806355778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:19,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:19,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:36:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997586126] [2024-11-10 18:36:19,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:19,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:36:19,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:19,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:36:19,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:36:19,587 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:36:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:19,645 INFO L93 Difference]: Finished difference Result 130 states and 164 transitions. [2024-11-10 18:36:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:36:19,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-10 18:36:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:19,647 INFO L225 Difference]: With dead ends: 130 [2024-11-10 18:36:19,648 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 18:36:19,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:36:19,651 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:19,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 206 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 18:36:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2024-11-10 18:36:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 62 states have internal predecessors, (69), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-10 18:36:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2024-11-10 18:36:19,678 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 18 [2024-11-10 18:36:19,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:19,678 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2024-11-10 18:36:19,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:36:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2024-11-10 18:36:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 18:36:19,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:19,679 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:19,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:36:19,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:19,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1695525905, now seen corresponding path program 1 times [2024-11-10 18:36:19,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:19,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847808336] [2024-11-10 18:36:19,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:19,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:19,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:36:19,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:19,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847808336] [2024-11-10 18:36:19,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847808336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:19,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:19,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:36:19,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147974591] [2024-11-10 18:36:19,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:19,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:36:19,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:19,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:36:19,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:36:19,766 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:36:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:19,789 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2024-11-10 18:36:19,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:36:19,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-10 18:36:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:19,791 INFO L225 Difference]: With dead ends: 103 [2024-11-10 18:36:19,792 INFO L226 Difference]: Without dead ends: 102 [2024-11-10 18:36:19,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:36:19,793 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:19,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:19,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-10 18:36:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2024-11-10 18:36:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.280701754385965) internal successors, (73), 64 states have internal predecessors, (73), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (20), 14 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-10 18:36:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2024-11-10 18:36:19,810 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 19 [2024-11-10 18:36:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:19,810 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2024-11-10 18:36:19,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:36:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2024-11-10 18:36:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 18:36:19,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:19,811 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:19,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:36:19,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:19,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:19,814 INFO L85 PathProgramCache]: Analyzing trace with hash -830112926, now seen corresponding path program 1 times [2024-11-10 18:36:19,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:19,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479110677] [2024-11-10 18:36:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:19,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:19,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 18:36:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:19,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:36:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:36:19,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:19,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479110677] [2024-11-10 18:36:19,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479110677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:19,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:19,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:36:19,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104504148] [2024-11-10 18:36:19,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:19,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:36:19,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:19,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:36:19,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:36:19,895 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:36:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:19,916 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2024-11-10 18:36:19,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:36:19,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-10 18:36:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:19,918 INFO L225 Difference]: With dead ends: 94 [2024-11-10 18:36:19,918 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 18:36:19,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:36:19,919 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:19,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 18:36:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-11-10 18:36:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 68 states have internal predecessors, (78), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (22), 16 states have call predecessors, (22), 12 states have call successors, (22) [2024-11-10 18:36:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2024-11-10 18:36:19,931 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 20 [2024-11-10 18:36:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:19,931 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2024-11-10 18:36:19,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:36:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2024-11-10 18:36:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 18:36:19,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:19,933 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:19,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:36:19,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:19,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:19,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1021695483, now seen corresponding path program 1 times [2024-11-10 18:36:19,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:19,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708881182] [2024-11-10 18:36:19,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:19,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:19,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:36:19,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:19,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708881182] [2024-11-10 18:36:19,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708881182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:19,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:19,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:36:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794282307] [2024-11-10 18:36:19,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:19,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:36:19,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:19,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:36:19,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:36:19,983 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:36:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:19,994 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2024-11-10 18:36:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:36:19,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-10 18:36:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:19,996 INFO L225 Difference]: With dead ends: 90 [2024-11-10 18:36:19,996 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 18:36:19,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:36:19,997 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:19,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 18:36:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-10 18:36:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 67 states have internal predecessors, (76), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (22), 16 states have call predecessors, (22), 12 states have call successors, (22) [2024-11-10 18:36:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2024-11-10 18:36:20,013 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 20 [2024-11-10 18:36:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:20,013 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2024-11-10 18:36:20,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:36:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2024-11-10 18:36:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 18:36:20,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:20,014 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:20,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:36:20,018 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:20,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:20,019 INFO L85 PathProgramCache]: Analyzing trace with hash 36303066, now seen corresponding path program 1 times [2024-11-10 18:36:20,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:20,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017460523] [2024-11-10 18:36:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:20,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 18:36:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:36:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:36:20,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:20,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017460523] [2024-11-10 18:36:20,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017460523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:20,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:20,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:36:20,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234096506] [2024-11-10 18:36:20,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:20,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:36:20,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:20,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:36:20,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:36:20,055 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:36:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:20,066 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2024-11-10 18:36:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:36:20,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-10 18:36:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:20,070 INFO L225 Difference]: With dead ends: 89 [2024-11-10 18:36:20,070 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 18:36:20,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:36:20,071 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:20,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 18:36:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-10 18:36:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.206896551724138) internal successors, (70), 63 states have internal predecessors, (70), 12 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (19), 14 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-10 18:36:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2024-11-10 18:36:20,087 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 21 [2024-11-10 18:36:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:20,087 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2024-11-10 18:36:20,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:36:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2024-11-10 18:36:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 18:36:20,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:20,089 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:20,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:36:20,090 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:20,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:20,091 INFO L85 PathProgramCache]: Analyzing trace with hash 803061430, now seen corresponding path program 1 times [2024-11-10 18:36:20,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:20,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367718134] [2024-11-10 18:36:20,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:36:20,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:20,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367718134] [2024-11-10 18:36:20,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367718134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:20,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:20,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:36:20,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647458432] [2024-11-10 18:36:20,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:20,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:36:20,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:20,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:36:20,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:36:20,160 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:36:20,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:20,222 INFO L93 Difference]: Finished difference Result 171 states and 226 transitions. [2024-11-10 18:36:20,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:36:20,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-10 18:36:20,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:20,224 INFO L225 Difference]: With dead ends: 171 [2024-11-10 18:36:20,224 INFO L226 Difference]: Without dead ends: 105 [2024-11-10 18:36:20,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:36:20,226 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:20,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 194 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-10 18:36:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2024-11-10 18:36:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 70 states have internal predecessors, (75), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (21), 14 states have call predecessors, (21), 13 states have call successors, (21) [2024-11-10 18:36:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2024-11-10 18:36:20,256 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 25 [2024-11-10 18:36:20,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:20,257 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2024-11-10 18:36:20,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:36:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2024-11-10 18:36:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 18:36:20,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:20,258 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:20,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:36:20,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:20,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash 466627736, now seen corresponding path program 1 times [2024-11-10 18:36:20,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:20,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093740803] [2024-11-10 18:36:20,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 18:36:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 18:36:20,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:20,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093740803] [2024-11-10 18:36:20,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093740803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:20,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:20,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:36:20,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59205103] [2024-11-10 18:36:20,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:20,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:36:20,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:20,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:36:20,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:36:20,338 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:36:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:20,401 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2024-11-10 18:36:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:36:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-10 18:36:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:20,403 INFO L225 Difference]: With dead ends: 181 [2024-11-10 18:36:20,403 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 18:36:20,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:36:20,405 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:20,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 205 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 18:36:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2024-11-10 18:36:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 75 states have internal predecessors, (80), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-10 18:36:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2024-11-10 18:36:20,416 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 31 [2024-11-10 18:36:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:20,416 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2024-11-10 18:36:20,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:36:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2024-11-10 18:36:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 18:36:20,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:20,418 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:20,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 18:36:20,418 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:20,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1751911889, now seen corresponding path program 1 times [2024-11-10 18:36:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712247355] [2024-11-10 18:36:20,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 18:36:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-10 18:36:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-10 18:36:20,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:20,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712247355] [2024-11-10 18:36:20,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712247355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:20,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:20,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:36:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941627167] [2024-11-10 18:36:20,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:20,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:36:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:20,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:36:20,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:36:20,465 INFO L87 Difference]: Start difference. First operand 99 states and 119 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:36:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:20,477 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2024-11-10 18:36:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:36:20,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-11-10 18:36:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:20,479 INFO L225 Difference]: With dead ends: 99 [2024-11-10 18:36:20,479 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 18:36:20,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:36:20,480 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:20,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 18:36:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 18:36:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 74 states have internal predecessors, (78), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-10 18:36:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2024-11-10 18:36:20,490 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 33 [2024-11-10 18:36:20,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:20,490 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2024-11-10 18:36:20,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:36:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2024-11-10 18:36:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 18:36:20,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:20,492 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:20,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 18:36:20,492 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:20,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:20,492 INFO L85 PathProgramCache]: Analyzing trace with hash -67205144, now seen corresponding path program 1 times [2024-11-10 18:36:20,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:20,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146895332] [2024-11-10 18:36:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:20,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 18:36:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 18:36:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 18:36:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-10 18:36:20,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:20,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146895332] [2024-11-10 18:36:20,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146895332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:20,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:20,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:36:20,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753670631] [2024-11-10 18:36:20,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:20,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:36:20,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:20,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:36:20,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:36:20,547 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:36:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:20,574 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2024-11-10 18:36:20,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:36:20,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-10 18:36:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:20,576 INFO L225 Difference]: With dead ends: 107 [2024-11-10 18:36:20,577 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 18:36:20,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:36:20,577 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:20,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 118 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 18:36:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2024-11-10 18:36:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.135135135135135) internal successors, (84), 78 states have internal predecessors, (84), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-10 18:36:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2024-11-10 18:36:20,594 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 39 [2024-11-10 18:36:20,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:20,594 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2024-11-10 18:36:20,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:36:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2024-11-10 18:36:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 18:36:20,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:20,598 INFO L215 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:20,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:36:20,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:20,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2060198572, now seen corresponding path program 1 times [2024-11-10 18:36:20,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:20,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536866090] [2024-11-10 18:36:20,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:20,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 18:36:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 18:36:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-10 18:36:20,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:20,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536866090] [2024-11-10 18:36:20,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536866090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:20,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:36:20,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:36:20,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953400463] [2024-11-10 18:36:20,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:20,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:36:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:20,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:36:20,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:36:20,725 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:36:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:20,774 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2024-11-10 18:36:20,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:36:20,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2024-11-10 18:36:20,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:20,775 INFO L225 Difference]: With dead ends: 116 [2024-11-10 18:36:20,775 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 18:36:20,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:36:20,776 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:20,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 169 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 18:36:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 103. [2024-11-10 18:36:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 77 states have internal predecessors, (82), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-10 18:36:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2024-11-10 18:36:20,786 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 49 [2024-11-10 18:36:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:20,786 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2024-11-10 18:36:20,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:36:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2024-11-10 18:36:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 18:36:20,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:20,787 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2024-11-10 18:36:20,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 18:36:20,787 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:20,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 994927461, now seen corresponding path program 1 times [2024-11-10 18:36:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:20,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567795880] [2024-11-10 18:36:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:20,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 18:36:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 18:36:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 18:36:20,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:20,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567795880] [2024-11-10 18:36:20,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567795880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:36:20,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109381479] [2024-11-10 18:36:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:20,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:36:20,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:36:20,922 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) [2024-11-10 18:36:20,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 18:36:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:20,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:36:21,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:36:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-10 18:36:21,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:36:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109381479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:21,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:36:21,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-11-10 18:36:21,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466364243] [2024-11-10 18:36:21,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:21,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:36:21,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:21,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:36:21,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:36:21,123 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:36:21,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:21,201 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2024-11-10 18:36:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:36:21,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2024-11-10 18:36:21,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:21,202 INFO L225 Difference]: With dead ends: 104 [2024-11-10 18:36:21,203 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 18:36:21,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-10 18:36:21,204 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:21,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 212 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 18:36:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-10 18:36:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-10 18:36:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2024-11-10 18:36:21,212 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 43 [2024-11-10 18:36:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:21,212 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2024-11-10 18:36:21,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:36:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2024-11-10 18:36:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 18:36:21,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:21,213 INFO L215 NwaCegarLoop]: trace histogram [6, 4, 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] [2024-11-10 18:36:21,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:36:21,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 18:36:21,416 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:21,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1331872604, now seen corresponding path program 1 times [2024-11-10 18:36:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:21,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723545539] [2024-11-10 18:36:21,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:21,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:21,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:21,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:21,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 18:36:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-10 18:36:21,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723545539] [2024-11-10 18:36:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723545539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:36:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862557724] [2024-11-10 18:36:21,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:21,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:36:21,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:36:21,574 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) [2024-11-10 18:36:21,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 18:36:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:21,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:36:21,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:36:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-10 18:36:21,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:36:21,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862557724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:21,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:36:21,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-11-10 18:36:21,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735178614] [2024-11-10 18:36:21,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:21,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:36:21,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:21,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:36:21,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:36:21,716 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:36:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:21,889 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2024-11-10 18:36:21,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:36:21,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2024-11-10 18:36:21,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:21,892 INFO L225 Difference]: With dead ends: 132 [2024-11-10 18:36:21,892 INFO L226 Difference]: Without dead ends: 131 [2024-11-10 18:36:21,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-11-10 18:36:21,893 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:21,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 214 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:36:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-10 18:36:21,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-10 18:36:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 95 states have (on average 1.0947368421052632) internal successors, (104), 97 states have internal predecessors, (104), 21 states have call successors, (21), 8 states have call predecessors, (21), 11 states have return successors, (31), 24 states have call predecessors, (31), 20 states have call successors, (31) [2024-11-10 18:36:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 156 transitions. [2024-11-10 18:36:21,906 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 156 transitions. Word has length 50 [2024-11-10 18:36:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:21,906 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 156 transitions. [2024-11-10 18:36:21,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:36:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 156 transitions. [2024-11-10 18:36:21,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 18:36:21,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:21,907 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1, 1, 1] [2024-11-10 18:36:21,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 18:36:22,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 18:36:22,113 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:22,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1784451218, now seen corresponding path program 1 times [2024-11-10 18:36:22,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:22,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62796947] [2024-11-10 18:36:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 18:36:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 18:36:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 18:36:22,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:22,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62796947] [2024-11-10 18:36:22,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62796947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:36:22,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477817867] [2024-11-10 18:36:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:22,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:36:22,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:36:22,227 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) [2024-11-10 18:36:22,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 18:36:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:36:22,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:36:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 18:36:22,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:36:22,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477817867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:36:22,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:36:22,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-10 18:36:22,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950812007] [2024-11-10 18:36:22,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:36:22,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:36:22,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:22,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:36:22,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:36:22,315 INFO L87 Difference]: Start difference. First operand 130 states and 156 transitions. Second operand has 5 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:36:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:22,372 INFO L93 Difference]: Finished difference Result 160 states and 193 transitions. [2024-11-10 18:36:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:36:22,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2024-11-10 18:36:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:22,373 INFO L225 Difference]: With dead ends: 160 [2024-11-10 18:36:22,373 INFO L226 Difference]: Without dead ends: 159 [2024-11-10 18:36:22,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-10 18:36:22,374 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:22,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 127 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:22,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-10 18:36:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-11-10 18:36:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 118 states have internal predecessors, (127), 26 states have call successors, (26), 9 states have call predecessors, (26), 13 states have return successors, (39), 30 states have call predecessors, (39), 25 states have call successors, (39) [2024-11-10 18:36:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 192 transitions. [2024-11-10 18:36:22,402 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 192 transitions. Word has length 48 [2024-11-10 18:36:22,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:22,402 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 192 transitions. [2024-11-10 18:36:22,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:36:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 192 transitions. [2024-11-10 18:36:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 18:36:22,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:22,404 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 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] [2024-11-10 18:36:22,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 18:36:22,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:36:22,609 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:22,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:22,609 INFO L85 PathProgramCache]: Analyzing trace with hash -593059136, now seen corresponding path program 1 times [2024-11-10 18:36:22,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:22,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730552136] [2024-11-10 18:36:22,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:22,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 18:36:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 18:36:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 18:36:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:36:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-10 18:36:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:22,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730552136] [2024-11-10 18:36:22,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730552136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:36:22,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254483536] [2024-11-10 18:36:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:22,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:36:22,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:36:22,694 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) [2024-11-10 18:36:22,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 18:36:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:22,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:36:22,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:36:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-10 18:36:22,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:36:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-10 18:36:22,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254483536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:36:22,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:36:22,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-10 18:36:22,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945566312] [2024-11-10 18:36:22,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:36:22,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:36:22,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:22,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:36:22,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:36:22,898 INFO L87 Difference]: Start difference. First operand 158 states and 192 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 18:36:22,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:22,939 INFO L93 Difference]: Finished difference Result 183 states and 222 transitions. [2024-11-10 18:36:22,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:36:22,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) Word has length 62 [2024-11-10 18:36:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:22,941 INFO L225 Difference]: With dead ends: 183 [2024-11-10 18:36:22,941 INFO L226 Difference]: Without dead ends: 176 [2024-11-10 18:36:22,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:36:22,941 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:22,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 182 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:36:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-10 18:36:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-10 18:36:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 131 states have (on average 1.083969465648855) internal successors, (142), 133 states have internal predecessors, (142), 26 states have call successors, (26), 9 states have call predecessors, (26), 16 states have return successors, (42), 33 states have call predecessors, (42), 25 states have call successors, (42) [2024-11-10 18:36:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 210 transitions. [2024-11-10 18:36:22,952 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 210 transitions. Word has length 62 [2024-11-10 18:36:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:22,952 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 210 transitions. [2024-11-10 18:36:22,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 18:36:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 210 transitions. [2024-11-10 18:36:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 18:36:22,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:22,953 INFO L215 NwaCegarLoop]: trace histogram [10, 8, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:22,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 18:36:23,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 18:36:23,155 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:23,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash -117091116, now seen corresponding path program 2 times [2024-11-10 18:36:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:23,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430179996] [2024-11-10 18:36:23,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:23,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:23,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:23,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 18:36:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:23,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 18:36:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:23,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:23,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:23,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 18:36:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 67 proven. 29 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-10 18:36:23,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430179996] [2024-11-10 18:36:23,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430179996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:36:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323256199] [2024-11-10 18:36:23,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:36:23,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:36:23,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:36:23,332 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) [2024-11-10 18:36:23,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 18:36:23,380 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:36:23,380 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:36:23,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:36:23,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:36:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 67 proven. 29 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-10 18:36:23,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:36:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 67 proven. 29 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-10 18:36:23,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323256199] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:36:23,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:36:23,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2024-11-10 18:36:23,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939457157] [2024-11-10 18:36:23,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:36:23,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:36:23,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:23,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:36:23,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:36:23,606 INFO L87 Difference]: Start difference. First operand 176 states and 210 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-10 18:36:23,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:23,690 INFO L93 Difference]: Finished difference Result 288 states and 349 transitions. [2024-11-10 18:36:23,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:36:23,691 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 81 [2024-11-10 18:36:23,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:23,692 INFO L225 Difference]: With dead ends: 288 [2024-11-10 18:36:23,692 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 18:36:23,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 171 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-10 18:36:23,693 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 31 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:23,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 182 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:36:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 18:36:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2024-11-10 18:36:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 77 states have internal predecessors, (79), 12 states have call successors, (12), 7 states have call predecessors, (12), 12 states have return successors, (18), 15 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-10 18:36:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-10 18:36:23,700 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 81 [2024-11-10 18:36:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:23,701 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-10 18:36:23,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-10 18:36:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-10 18:36:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-10 18:36:23,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:36:23,703 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 19, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2024-11-10 18:36:23,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 18:36:23,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:36:23,904 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-10 18:36:23,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:36:23,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1747348928, now seen corresponding path program 2 times [2024-11-10 18:36:23,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:36:23,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014843619] [2024-11-10 18:36:23,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:36:23,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:36:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 18:36:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 18:36:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:36:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 18:36:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 18:36:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 18:36:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 18:36:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 18:36:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 18:36:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 18:36:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 18:36:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 18:36:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 18:36:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 18:36:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 18:36:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:36:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:36:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 58 proven. 280 refuted. 0 times theorem prover too weak. 1270 trivial. 0 not checked. [2024-11-10 18:36:24,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:36:24,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014843619] [2024-11-10 18:36:24,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014843619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:36:24,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498338690] [2024-11-10 18:36:24,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:36:24,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:36:24,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:36:24,234 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) [2024-11-10 18:36:24,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 18:36:24,340 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:36:24,341 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:36:24,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 18:36:24,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:36:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 750 proven. 25 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-11-10 18:36:24,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:36:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 58 proven. 280 refuted. 0 times theorem prover too weak. 1270 trivial. 0 not checked. [2024-11-10 18:36:24,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498338690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:36:24,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:36:24,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2024-11-10 18:36:24,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191097087] [2024-11-10 18:36:24,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:36:24,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 18:36:24,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:36:24,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 18:36:24,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:36:24,824 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 6 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-10 18:36:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:36:24,950 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2024-11-10 18:36:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:36:24,951 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 6 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 260 [2024-11-10 18:36:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:36:24,951 INFO L225 Difference]: With dead ends: 146 [2024-11-10 18:36:24,951 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 18:36:24,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 570 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-10 18:36:24,952 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:36:24,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 212 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:36:24,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 18:36:24,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 18:36:24,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:36:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 18:36:24,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2024-11-10 18:36:24,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:36:24,953 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 18:36:24,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 6 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-10 18:36:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 18:36:24,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 18:36:24,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-11-10 18:36:24,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-11-10 18:36:24,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-11-10 18:36:24,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-11-10 18:36:24,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-11-10 18:36:24,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-11-10 18:36:24,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-11-10 18:36:24,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-11-10 18:36:24,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-11-10 18:36:24,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-11-10 18:36:24,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 18:36:25,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:36:25,161 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:36:25,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 18:36:25,666 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:36:25,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:36:25 BoogieIcfgContainer [2024-11-10 18:36:25,695 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:36:25,696 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:36:25,696 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:36:25,696 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:36:25,697 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:36:18" (3/4) ... [2024-11-10 18:36:25,699 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:36:25,703 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure rec1 [2024-11-10 18:36:25,703 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure rec2 [2024-11-10 18:36:25,708 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-10 18:36:25,709 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 18:36:25,709 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-10 18:36:25,791 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:36:25,792 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:36:25,792 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:36:25,793 INFO L158 Benchmark]: Toolchain (without parser) took 8219.78ms. Allocated memory was 140.5MB in the beginning and 239.1MB in the end (delta: 98.6MB). Free memory was 71.3MB in the beginning and 195.6MB in the end (delta: -124.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:36:25,793 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 140.5MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:36:25,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.23ms. Allocated memory is still 140.5MB. Free memory was 71.0MB in the beginning and 105.9MB in the end (delta: -34.8MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-11-10 18:36:25,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.69ms. Allocated memory is still 140.5MB. Free memory was 105.9MB in the beginning and 104.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:36:25,794 INFO L158 Benchmark]: Boogie Preprocessor took 30.45ms. Allocated memory is still 140.5MB. Free memory was 104.7MB in the beginning and 103.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:36:25,794 INFO L158 Benchmark]: IcfgBuilder took 309.96ms. Allocated memory is still 140.5MB. Free memory was 103.3MB in the beginning and 91.6MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 18:36:25,796 INFO L158 Benchmark]: TraceAbstraction took 7424.56ms. Allocated memory was 140.5MB in the beginning and 239.1MB in the end (delta: 98.6MB). Free memory was 91.2MB in the beginning and 200.8MB in the end (delta: -109.6MB). Peak memory consumption was 118.4MB. Max. memory is 16.1GB. [2024-11-10 18:36:25,796 INFO L158 Benchmark]: Witness Printer took 96.55ms. Allocated memory is still 239.1MB. Free memory was 200.8MB in the beginning and 195.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:36:25,797 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 140.5MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.23ms. Allocated memory is still 140.5MB. Free memory was 71.0MB in the beginning and 105.9MB in the end (delta: -34.8MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.69ms. Allocated memory is still 140.5MB. Free memory was 105.9MB in the beginning and 104.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.45ms. Allocated memory is still 140.5MB. Free memory was 104.7MB in the beginning and 103.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 309.96ms. Allocated memory is still 140.5MB. Free memory was 103.3MB in the beginning and 91.6MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7424.56ms. Allocated memory was 140.5MB in the beginning and 239.1MB in the end (delta: 98.6MB). Free memory was 91.2MB in the beginning and 200.8MB in the end (delta: -109.6MB). Peak memory consumption was 118.4MB. Max. memory is 16.1GB. * Witness Printer took 96.55ms. Allocated memory is still 239.1MB. Free memory was 200.8MB in the beginning and 195.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 20, TraceHistogramMax: 25, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 338 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 308 mSDsluCounter, 3036 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2213 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 811 IncrementalHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 823 mSDtfsCounter, 811 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1217 GetRequests, 1084 SyntacticMatches, 12 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=18, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 97 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1399 NumberOfCodeBlocks, 1399 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1773 ConstructedInterpolants, 0 QuantifiedInterpolants, 2555 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1061 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 5224/5914 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - ProcedureContractResult [Line: 11]: Procedure Contract for rec1 Derived contract for procedure rec1. Requires: (i <= 2147483647) Ensures: ((i <= 2147483647) && ((\result == 0) || ((\result == 1) && (1 <= i)))) - ProcedureContractResult [Line: 17]: Procedure Contract for rec2 Derived contract for procedure rec2. Requires: (j <= 2147483647) Ensures: ((((0 < ((long) \result + 1)) || (0 < j)) && (j <= 2147483647)) && ((0 < (\result + 2147483648)) || (1 < j))) RESULT: Ultimate proved your program to be correct! [2024-11-10 18:36:25,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE