./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 32bit --witnessprinter.graph.data.programhash befa5004268d4c15cae2c05402ac6cc0f86cef85e498084909e66f7e8cc4b8f3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:59:07,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:59:07,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:59:07,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:59:07,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:59:07,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:59:07,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:59:07,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:59:07,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:59:07,749 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:59:07,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:59:07,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:59:07,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:59:07,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:59:07,754 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:59:07,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:59:07,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:59:07,755 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:59:07,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:59:07,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:59:07,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:59:07,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:59:07,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:59:07,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:59:07,757 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:59:07,757 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:59:07,757 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:59:07,757 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:59:07,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:59:07,757 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:59:07,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:59:07,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:59:07,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:59:07,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:59:07,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:59:07,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:59:07,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:59:07,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:59:07,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:59:07,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:59:07,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:59:07,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:59:07,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:59:07,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:59:07,762 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-clean/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-clean/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> befa5004268d4c15cae2c05402ac6cc0f86cef85e498084909e66f7e8cc4b8f3 [2024-10-11 20:59:07,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:59:07,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:59:07,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:59:07,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:59:07,976 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:59:07,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c [2024-10-11 20:59:09,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:59:09,406 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:59:09,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c [2024-10-11 20:59:09,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f5a689da5/e29cd791a5154009b7fa65e8faa83548/FLAGad25351bb [2024-10-11 20:59:09,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f5a689da5/e29cd791a5154009b7fa65e8faa83548 [2024-10-11 20:59:09,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:59:09,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:59:09,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:59:09,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:59:09,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:59:09,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:59:09" (1/1) ... [2024-10-11 20:59:09,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b515ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:09, skipping insertion in model container [2024-10-11 20:59:09,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:59:09" (1/1) ... [2024-10-11 20:59:09,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:59:10,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:59:10,017 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:59:10,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:59:10,059 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:59:10,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10 WrapperNode [2024-10-11 20:59:10,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:59:10,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:59:10,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:59:10,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:59:10,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10" (1/1) ... [2024-10-11 20:59:10,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10" (1/1) ... [2024-10-11 20:59:10,094 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-10-11 20:59:10,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:59:10,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:59:10,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:59:10,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:59:10,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10" (1/1) ... [2024-10-11 20:59:10,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10" (1/1) ... [2024-10-11 20:59:10,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10" (1/1) ... [2024-10-11 20:59:10,114 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-11 20:59:10,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10" (1/1) ... [2024-10-11 20:59:10,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10" (1/1) ... [2024-10-11 20:59:10,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10" (1/1) ... [2024-10-11 20:59:10,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10" (1/1) ... [2024-10-11 20:59:10,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10" (1/1) ... [2024-10-11 20:59:10,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10" (1/1) ... [2024-10-11 20:59:10,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:59:10,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:59:10,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:59:10,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:59:10,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10" (1/1) ... [2024-10-11 20:59:10,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:59:10,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:10,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:59:10,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:59:10,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:59:10,207 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 20:59:10,207 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 20:59:10,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:59:10,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:59:10,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:59:10,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:59:10,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:59:10,208 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:59:10,270 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:59:10,272 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:59:10,414 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-11 20:59:10,415 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:59:10,446 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:59:10,446 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 20:59:10,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:59:10 BoogieIcfgContainer [2024-10-11 20:59:10,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:59:10,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:59:10,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:59:10,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:59:10,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:59:09" (1/3) ... [2024-10-11 20:59:10,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e7704f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:59:10, skipping insertion in model container [2024-10-11 20:59:10,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:10" (2/3) ... [2024-10-11 20:59:10,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e7704f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:59:10, skipping insertion in model container [2024-10-11 20:59:10,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:59:10" (3/3) ... [2024-10-11 20:59:10,456 INFO L112 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound5.c [2024-10-11 20:59:10,468 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:59:10,468 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 20:59:10,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:59:10,514 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;@15128eae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:59:10,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 20:59:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 30 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:59:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 20:59:10,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:10,524 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:10,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:10,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash 529971304, now seen corresponding path program 1 times [2024-10-11 20:59:10,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:10,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698603658] [2024-10-11 20:59:10,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:10,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:10,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:10,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:10,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:59:10,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:10,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698603658] [2024-10-11 20:59:10,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698603658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:10,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:10,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:59:10,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389346088] [2024-10-11 20:59:10,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:10,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:59:10,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:10,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:59:10,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:59:10,701 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 30 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:59:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:10,721 INFO L93 Difference]: Finished difference Result 82 states and 124 transitions. [2024-10-11 20:59:10,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:59:10,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2024-10-11 20:59:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:10,727 INFO L225 Difference]: With dead ends: 82 [2024-10-11 20:59:10,728 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 20:59:10,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:59:10,732 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:10,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:59:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 20:59:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 20:59:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.434782608695652) internal successors, (33), 28 states have internal predecessors, (33), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:59:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-10-11 20:59:10,760 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 24 [2024-10-11 20:59:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:10,760 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-11 20:59:10,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:59:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-10-11 20:59:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 20:59:10,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:10,762 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:10,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:59:10,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:10,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash 689927656, now seen corresponding path program 1 times [2024-10-11 20:59:10,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:10,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622728107] [2024-10-11 20:59:10,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:10,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:10,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:10,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:10,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:10,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:59:10,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:10,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622728107] [2024-10-11 20:59:10,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622728107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:10,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:10,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:59:10,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433480213] [2024-10-11 20:59:10,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:10,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:59:10,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:10,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:59:10,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:59:10,944 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:59:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:11,046 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-10-11 20:59:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:59:11,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 24 [2024-10-11 20:59:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:11,047 INFO L225 Difference]: With dead ends: 44 [2024-10-11 20:59:11,048 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 20:59:11,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:59:11,050 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:11,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 109 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:59:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 20:59:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-10-11 20:59:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 31 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:59:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-10-11 20:59:11,062 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 24 [2024-10-11 20:59:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:11,063 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-10-11 20:59:11,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:59:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-10-11 20:59:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 20:59:11,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:11,065 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:11,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:59:11,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:11,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash -254797239, now seen corresponding path program 1 times [2024-10-11 20:59:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:11,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548287115] [2024-10-11 20:59:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:11,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:59:11,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:11,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548287115] [2024-10-11 20:59:11,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548287115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:11,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:11,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:59:11,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681795368] [2024-10-11 20:59:11,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:11,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:59:11,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:11,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:59:11,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:59:11,255 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:59:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:11,382 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2024-10-11 20:59:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:59:11,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2024-10-11 20:59:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:11,383 INFO L225 Difference]: With dead ends: 61 [2024-10-11 20:59:11,385 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 20:59:11,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:59:11,386 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:11,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 172 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:59:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 20:59:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2024-10-11 20:59:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 41 states have internal predecessors, (49), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:59:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2024-10-11 20:59:11,394 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 34 [2024-10-11 20:59:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:11,395 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2024-10-11 20:59:11,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:59:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2024-10-11 20:59:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:59:11,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:11,396 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:11,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:59:11,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:11,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash 691220249, now seen corresponding path program 1 times [2024-10-11 20:59:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:11,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162827937] [2024-10-11 20:59:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:11,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:59:11,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:11,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162827937] [2024-10-11 20:59:11,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162827937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:11,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:11,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:59:11,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74394740] [2024-10-11 20:59:11,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:11,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:59:11,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:11,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:59:11,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:59:11,509 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:59:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:11,598 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2024-10-11 20:59:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:59:11,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2024-10-11 20:59:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:11,601 INFO L225 Difference]: With dead ends: 90 [2024-10-11 20:59:11,601 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 20:59:11,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:59:11,602 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:11,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 183 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:59:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 20:59:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 20:59:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.302325581395349) internal successors, (56), 48 states have internal predecessors, (56), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:59:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2024-10-11 20:59:11,614 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 35 [2024-10-11 20:59:11,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:11,615 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2024-10-11 20:59:11,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:59:11,615 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2024-10-11 20:59:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 20:59:11,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:11,618 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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-10-11 20:59:11,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:59:11,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:11,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:11,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1149535416, now seen corresponding path program 1 times [2024-10-11 20:59:11,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:11,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074136526] [2024-10-11 20:59:11,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:11,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:59:11,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:11,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074136526] [2024-10-11 20:59:11,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074136526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:11,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:11,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:59:11,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303055258] [2024-10-11 20:59:11,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:11,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:59:11,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:11,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:59:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:59:11,770 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:59:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:11,931 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2024-10-11 20:59:11,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:59:11,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2024-10-11 20:59:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:11,932 INFO L225 Difference]: With dead ends: 80 [2024-10-11 20:59:11,932 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 20:59:11,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:59:11,933 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:11,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 202 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:59:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 20:59:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2024-10-11 20:59:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:59:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2024-10-11 20:59:11,946 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 44 [2024-10-11 20:59:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:11,946 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2024-10-11 20:59:11,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:59:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2024-10-11 20:59:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:59:11,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:11,947 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:11,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:59:11,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:11,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1275859616, now seen corresponding path program 1 times [2024-10-11 20:59:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:11,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028971871] [2024-10-11 20:59:11,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:11,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:59:12,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:12,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028971871] [2024-10-11 20:59:12,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028971871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:12,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:12,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:59:12,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771070755] [2024-10-11 20:59:12,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:12,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:59:12,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:12,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:59:12,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:59:12,085 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:59:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:12,173 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2024-10-11 20:59:12,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:59:12,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2024-10-11 20:59:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:12,175 INFO L225 Difference]: With dead ends: 114 [2024-10-11 20:59:12,175 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 20:59:12,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:59:12,176 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 38 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:12,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 169 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:59:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 20:59:12,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-10-11 20:59:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 64 states have internal predecessors, (76), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 20:59:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2024-10-11 20:59:12,187 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 45 [2024-10-11 20:59:12,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:12,187 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2024-10-11 20:59:12,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:59:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2024-10-11 20:59:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:59:12,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:12,188 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-10-11 20:59:12,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:59:12,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:12,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1275897352, now seen corresponding path program 1 times [2024-10-11 20:59:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:12,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61284335] [2024-10-11 20:59:12,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:12,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:59:12,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:12,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61284335] [2024-10-11 20:59:12,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61284335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:12,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433035958] [2024-10-11 20:59:12,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:12,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:12,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:12,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:12,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:59:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:12,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:59:12,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:59:12,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:59:12,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433035958] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:59:12,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:59:12,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2024-10-11 20:59:12,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216041215] [2024-10-11 20:59:12,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:12,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 20:59:12,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:12,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 20:59:12,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:59:12,616 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2024-10-11 20:59:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:12,930 INFO L93 Difference]: Finished difference Result 232 states and 282 transitions. [2024-10-11 20:59:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 20:59:12,930 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Word has length 45 [2024-10-11 20:59:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:12,932 INFO L225 Difference]: With dead ends: 232 [2024-10-11 20:59:12,932 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 20:59:12,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2024-10-11 20:59:12,934 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 157 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:12,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 363 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:59:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 20:59:12,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 162. [2024-10-11 20:59:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 124 states have (on average 1.2741935483870968) internal successors, (158), 129 states have internal predecessors, (158), 18 states have call successors, (18), 14 states have call predecessors, (18), 14 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 20:59:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 194 transitions. [2024-10-11 20:59:12,958 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 194 transitions. Word has length 45 [2024-10-11 20:59:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:12,959 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 194 transitions. [2024-10-11 20:59:12,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2024-10-11 20:59:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 194 transitions. [2024-10-11 20:59:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 20:59:12,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:12,962 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:12,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:59:13,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:13,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:13,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1415234297, now seen corresponding path program 1 times [2024-10-11 20:59:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:13,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475804705] [2024-10-11 20:59:13,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:59:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 20:59:13,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:13,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475804705] [2024-10-11 20:59:13,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475804705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:13,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:13,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:59:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403638017] [2024-10-11 20:59:13,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:13,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:59:13,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:13,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:59:13,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:59:13,289 INFO L87 Difference]: Start difference. First operand 162 states and 194 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 20:59:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:13,334 INFO L93 Difference]: Finished difference Result 269 states and 328 transitions. [2024-10-11 20:59:13,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:59:13,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2024-10-11 20:59:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:13,337 INFO L225 Difference]: With dead ends: 269 [2024-10-11 20:59:13,337 INFO L226 Difference]: Without dead ends: 204 [2024-10-11 20:59:13,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:59:13,339 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 32 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:13,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 168 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:59:13,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-11 20:59:13,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 182. [2024-10-11 20:59:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 140 states have (on average 1.292857142857143) internal successors, (181), 145 states have internal predecessors, (181), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 20:59:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 225 transitions. [2024-10-11 20:59:13,367 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 225 transitions. Word has length 54 [2024-10-11 20:59:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:13,367 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 225 transitions. [2024-10-11 20:59:13,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 20:59:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 225 transitions. [2024-10-11 20:59:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 20:59:13,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:13,368 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:13,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:59:13,370 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:13,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash 922691581, now seen corresponding path program 1 times [2024-10-11 20:59:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:13,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023145077] [2024-10-11 20:59:13,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:59:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 20:59:13,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:13,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023145077] [2024-10-11 20:59:13,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023145077] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:13,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614217907] [2024-10-11 20:59:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:13,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:13,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:13,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:13,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:59:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:13,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:59:13,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:59:13,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 20:59:13,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614217907] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:59:13,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:59:13,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-10-11 20:59:13,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444204825] [2024-10-11 20:59:13,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:13,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 20:59:13,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:13,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 20:59:13,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:59:13,786 INFO L87 Difference]: Start difference. First operand 182 states and 225 transitions. Second operand has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2024-10-11 20:59:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:14,364 INFO L93 Difference]: Finished difference Result 378 states and 472 transitions. [2024-10-11 20:59:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-11 20:59:14,364 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) Word has length 55 [2024-10-11 20:59:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:14,366 INFO L225 Difference]: With dead ends: 378 [2024-10-11 20:59:14,366 INFO L226 Difference]: Without dead ends: 295 [2024-10-11 20:59:14,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=507, Invalid=1943, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 20:59:14,368 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 201 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:14,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 359 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:59:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-11 20:59:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 262. [2024-10-11 20:59:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 205 states have (on average 1.278048780487805) internal successors, (262), 210 states have internal predecessors, (262), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 20:59:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 320 transitions. [2024-10-11 20:59:14,394 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 320 transitions. Word has length 55 [2024-10-11 20:59:14,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:14,394 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 320 transitions. [2024-10-11 20:59:14,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2024-10-11 20:59:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 320 transitions. [2024-10-11 20:59:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 20:59:14,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:14,397 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:14,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:59:14,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:14,599 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:14,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:14,599 INFO L85 PathProgramCache]: Analyzing trace with hash -810399314, now seen corresponding path program 1 times [2024-10-11 20:59:14,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:14,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967617410] [2024-10-11 20:59:14,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:14,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:14,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:14,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:14,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:14,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:14,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:14,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:14,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:59:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 20:59:14,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:14,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967617410] [2024-10-11 20:59:14,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967617410] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:14,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871747388] [2024-10-11 20:59:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:14,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:14,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:14,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:14,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:59:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:14,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:59:14,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:59:14,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 20:59:14,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871747388] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:59:14,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:59:14,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 17 [2024-10-11 20:59:14,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162700569] [2024-10-11 20:59:14,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:14,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 20:59:14,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:14,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 20:59:14,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:59:14,962 INFO L87 Difference]: Start difference. First operand 262 states and 320 transitions. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 6 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-10-11 20:59:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:15,174 INFO L93 Difference]: Finished difference Result 424 states and 525 transitions. [2024-10-11 20:59:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 20:59:15,175 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 6 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 58 [2024-10-11 20:59:15,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:15,176 INFO L225 Difference]: With dead ends: 424 [2024-10-11 20:59:15,176 INFO L226 Difference]: Without dead ends: 285 [2024-10-11 20:59:15,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2024-10-11 20:59:15,177 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 63 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:15,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 266 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:59:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-11 20:59:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 280. [2024-10-11 20:59:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 221 states have (on average 1.257918552036199) internal successors, (278), 226 states have internal predecessors, (278), 30 states have call successors, (30), 23 states have call predecessors, (30), 23 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 20:59:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 338 transitions. [2024-10-11 20:59:15,190 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 338 transitions. Word has length 58 [2024-10-11 20:59:15,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:15,190 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 338 transitions. [2024-10-11 20:59:15,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 6 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-10-11 20:59:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 338 transitions. [2024-10-11 20:59:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 20:59:15,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:15,191 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:15,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:59:15,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:15,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:15,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:15,393 INFO L85 PathProgramCache]: Analyzing trace with hash -809671108, now seen corresponding path program 1 times [2024-10-11 20:59:15,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:15,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930294536] [2024-10-11 20:59:15,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:15,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:15,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:15,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:15,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:15,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:15,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:15,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:15,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:59:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:15,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 20:59:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 20:59:15,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:15,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930294536] [2024-10-11 20:59:15,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930294536] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:15,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672407966] [2024-10-11 20:59:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:15,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:15,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:15,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:15,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:59:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:15,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 20:59:15,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:59:15,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:59:15,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672407966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:15,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:59:15,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2024-10-11 20:59:15,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001012032] [2024-10-11 20:59:15,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:15,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:59:15,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:15,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:59:15,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:59:15,760 INFO L87 Difference]: Start difference. First operand 280 states and 338 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 20:59:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:15,962 INFO L93 Difference]: Finished difference Result 348 states and 420 transitions. [2024-10-11 20:59:15,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 20:59:15,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 64 [2024-10-11 20:59:15,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:15,965 INFO L225 Difference]: With dead ends: 348 [2024-10-11 20:59:15,965 INFO L226 Difference]: Without dead ends: 345 [2024-10-11 20:59:15,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2024-10-11 20:59:15,966 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 88 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:15,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 160 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:59:15,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-11 20:59:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 254. [2024-10-11 20:59:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 201 states have (on average 1.1840796019900497) internal successors, (238), 204 states have internal predecessors, (238), 28 states have call successors, (28), 22 states have call predecessors, (28), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 20:59:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 294 transitions. [2024-10-11 20:59:15,985 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 294 transitions. Word has length 64 [2024-10-11 20:59:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:15,985 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 294 transitions. [2024-10-11 20:59:15,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 20:59:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 294 transitions. [2024-10-11 20:59:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 20:59:15,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:15,986 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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-10-11 20:59:16,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:59:16,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:59:16,187 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:16,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:16,187 INFO L85 PathProgramCache]: Analyzing trace with hash 669999474, now seen corresponding path program 1 times [2024-10-11 20:59:16,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:16,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004767971] [2024-10-11 20:59:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:16,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:16,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:16,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:16,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:16,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:16,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:16,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:16,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:59:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:16,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 20:59:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 20:59:16,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:16,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004767971] [2024-10-11 20:59:16,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004767971] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:16,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371137333] [2024-10-11 20:59:16,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:16,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:16,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:16,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:16,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:59:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:16,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 20:59:16,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:59:16,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 20:59:16,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371137333] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:59:16,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:59:16,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2024-10-11 20:59:16,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073596680] [2024-10-11 20:59:16,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:16,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 20:59:16,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:16,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 20:59:16,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2024-10-11 20:59:16,811 INFO L87 Difference]: Start difference. First operand 254 states and 294 transitions. Second operand has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 31 states have internal predecessors, (89), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2024-10-11 20:59:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:17,415 INFO L93 Difference]: Finished difference Result 293 states and 341 transitions. [2024-10-11 20:59:17,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-11 20:59:17,415 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 31 states have internal predecessors, (89), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) Word has length 65 [2024-10-11 20:59:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:17,418 INFO L225 Difference]: With dead ends: 293 [2024-10-11 20:59:17,418 INFO L226 Difference]: Without dead ends: 292 [2024-10-11 20:59:17,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=715, Invalid=2945, Unknown=0, NotChecked=0, Total=3660 [2024-10-11 20:59:17,420 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 162 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:17,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 390 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:59:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-11 20:59:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 267. [2024-10-11 20:59:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 212 states have (on average 1.179245283018868) internal successors, (250), 215 states have internal predecessors, (250), 29 states have call successors, (29), 23 states have call predecessors, (29), 23 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 20:59:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 308 transitions. [2024-10-11 20:59:17,434 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 308 transitions. Word has length 65 [2024-10-11 20:59:17,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:17,434 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 308 transitions. [2024-10-11 20:59:17,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 31 states have internal predecessors, (89), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2024-10-11 20:59:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 308 transitions. [2024-10-11 20:59:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 20:59:17,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:17,435 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:17,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:59:17,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 20:59:17,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:17,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:17,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1479903319, now seen corresponding path program 1 times [2024-10-11 20:59:17,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:17,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430048234] [2024-10-11 20:59:17,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:17,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:17,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:17,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:17,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:17,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:17,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:17,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:17,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:59:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:17,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 20:59:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 20:59:17,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:17,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430048234] [2024-10-11 20:59:17,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430048234] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:17,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041884175] [2024-10-11 20:59:17,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:17,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:17,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:17,843 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:17,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:59:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:17,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 20:59:17,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:59:17,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 20:59:18,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041884175] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:59:18,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:59:18,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 15 [2024-10-11 20:59:18,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000945420] [2024-10-11 20:59:18,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:18,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:59:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:18,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:59:18,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:59:18,087 INFO L87 Difference]: Start difference. First operand 267 states and 308 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-10-11 20:59:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:18,243 INFO L93 Difference]: Finished difference Result 426 states and 496 transitions. [2024-10-11 20:59:18,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 20:59:18,245 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 69 [2024-10-11 20:59:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:18,246 INFO L225 Difference]: With dead ends: 426 [2024-10-11 20:59:18,246 INFO L226 Difference]: Without dead ends: 267 [2024-10-11 20:59:18,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 141 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2024-10-11 20:59:18,247 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:18,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 270 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:59:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-11 20:59:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-10-11 20:59:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 212 states have (on average 1.1745283018867925) internal successors, (249), 215 states have internal predecessors, (249), 29 states have call successors, (29), 23 states have call predecessors, (29), 23 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 20:59:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 307 transitions. [2024-10-11 20:59:18,261 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 307 transitions. Word has length 69 [2024-10-11 20:59:18,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:18,262 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 307 transitions. [2024-10-11 20:59:18,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-10-11 20:59:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 307 transitions. [2024-10-11 20:59:18,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 20:59:18,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:18,262 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:18,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:59:18,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:59:18,463 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:18,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:18,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1835630867, now seen corresponding path program 1 times [2024-10-11 20:59:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:18,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233290155] [2024-10-11 20:59:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:18,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:18,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:18,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:18,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:18,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:18,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:18,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:59:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:18,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 20:59:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:18,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 20:59:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 20:59:18,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:18,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233290155] [2024-10-11 20:59:18,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233290155] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:18,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769953710] [2024-10-11 20:59:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:18,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:18,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:18,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:18,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:59:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:18,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:59:18,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:59:18,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 20:59:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769953710] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:59:19,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:59:19,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2024-10-11 20:59:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549126132] [2024-10-11 20:59:19,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:19,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 20:59:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 20:59:19,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 20:59:19,066 INFO L87 Difference]: Start difference. First operand 267 states and 307 transitions. Second operand has 36 states, 35 states have (on average 3.057142857142857) internal successors, (107), 36 states have internal predecessors, (107), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2024-10-11 20:59:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:20,103 INFO L93 Difference]: Finished difference Result 455 states and 537 transitions. [2024-10-11 20:59:20,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-11 20:59:20,103 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.057142857142857) internal successors, (107), 36 states have internal predecessors, (107), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) Word has length 75 [2024-10-11 20:59:20,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:20,105 INFO L225 Difference]: With dead ends: 455 [2024-10-11 20:59:20,107 INFO L226 Difference]: Without dead ends: 453 [2024-10-11 20:59:20,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1283, Invalid=4723, Unknown=0, NotChecked=0, Total=6006 [2024-10-11 20:59:20,109 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 249 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:20,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 311 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:59:20,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-10-11 20:59:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 386. [2024-10-11 20:59:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 307 states have (on average 1.1954397394136809) internal successors, (367), 310 states have internal predecessors, (367), 41 states have call successors, (41), 35 states have call predecessors, (41), 35 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-11 20:59:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 449 transitions. [2024-10-11 20:59:20,126 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 449 transitions. Word has length 75 [2024-10-11 20:59:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:20,126 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 449 transitions. [2024-10-11 20:59:20,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.057142857142857) internal successors, (107), 36 states have internal predecessors, (107), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2024-10-11 20:59:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 449 transitions. [2024-10-11 20:59:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 20:59:20,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:20,127 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:20,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:59:20,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:20,329 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:20,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:20,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1415397726, now seen corresponding path program 1 times [2024-10-11 20:59:20,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:20,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605650193] [2024-10-11 20:59:20,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:20,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:20,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:20,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:20,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:20,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:20,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:20,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:20,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:59:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:20,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 20:59:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:20,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 20:59:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 20:59:20,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605650193] [2024-10-11 20:59:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605650193] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772228036] [2024-10-11 20:59:20,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:20,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:20,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:20,538 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:20,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:59:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:20,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 20:59:20,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 3 proven. 76 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:59:20,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 20:59:21,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772228036] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:59:21,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:59:21,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 40 [2024-10-11 20:59:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769752371] [2024-10-11 20:59:21,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:21,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 20:59:21,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:21,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 20:59:21,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1315, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 20:59:21,013 INFO L87 Difference]: Start difference. First operand 386 states and 449 transitions. Second operand has 41 states, 40 states have (on average 2.975) internal successors, (119), 41 states have internal predecessors, (119), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2024-10-11 20:59:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:22,106 INFO L93 Difference]: Finished difference Result 496 states and 574 transitions. [2024-10-11 20:59:22,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-11 20:59:22,106 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 41 states have internal predecessors, (119), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) Word has length 79 [2024-10-11 20:59:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:22,108 INFO L225 Difference]: With dead ends: 496 [2024-10-11 20:59:22,108 INFO L226 Difference]: Without dead ends: 495 [2024-10-11 20:59:22,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1498, Invalid=6158, Unknown=0, NotChecked=0, Total=7656 [2024-10-11 20:59:22,112 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 328 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:22,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 345 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:59:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-11 20:59:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 344. [2024-10-11 20:59:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 273 states have (on average 1.1941391941391941) internal successors, (326), 276 states have internal predecessors, (326), 37 states have call successors, (37), 31 states have call predecessors, (37), 31 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 20:59:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 400 transitions. [2024-10-11 20:59:22,130 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 400 transitions. Word has length 79 [2024-10-11 20:59:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:22,130 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 400 transitions. [2024-10-11 20:59:22,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 41 states have internal predecessors, (119), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2024-10-11 20:59:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 400 transitions. [2024-10-11 20:59:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 20:59:22,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:22,132 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-11 20:59:22,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:59:22,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:59:22,333 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:22,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1962574787, now seen corresponding path program 1 times [2024-10-11 20:59:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:22,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263216841] [2024-10-11 20:59:22,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:22,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:22,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:22,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:22,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:22,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:22,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:59:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:22,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 20:59:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:22,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 20:59:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:22,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 20:59:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:22,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 20:59:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-11 20:59:22,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263216841] [2024-10-11 20:59:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263216841] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962484263] [2024-10-11 20:59:22,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:22,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:22,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:22,543 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:22,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:59:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:22,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 20:59:22,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 20:59:22,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-11 20:59:22,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962484263] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:59:22,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:59:22,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 17 [2024-10-11 20:59:22,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702736944] [2024-10-11 20:59:22,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:22,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 20:59:22,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:22,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 20:59:22,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:59:22,831 INFO L87 Difference]: Start difference. First operand 344 states and 400 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2024-10-11 20:59:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:23,181 INFO L93 Difference]: Finished difference Result 768 states and 899 transitions. [2024-10-11 20:59:23,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 20:59:23,181 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) Word has length 95 [2024-10-11 20:59:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:23,184 INFO L225 Difference]: With dead ends: 768 [2024-10-11 20:59:23,185 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 20:59:23,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 198 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2024-10-11 20:59:23,187 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 57 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:23,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 548 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:59:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 20:59:23,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 515. [2024-10-11 20:59:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 412 states have (on average 1.2135922330097086) internal successors, (500), 415 states have internal predecessors, (500), 53 states have call successors, (53), 47 states have call predecessors, (53), 47 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-11 20:59:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 606 transitions. [2024-10-11 20:59:23,220 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 606 transitions. Word has length 95 [2024-10-11 20:59:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:23,220 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 606 transitions. [2024-10-11 20:59:23,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2024-10-11 20:59:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 606 transitions. [2024-10-11 20:59:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 20:59:23,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:23,222 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:23,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:59:23,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:23,422 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:23,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:23,423 INFO L85 PathProgramCache]: Analyzing trace with hash -901386496, now seen corresponding path program 1 times [2024-10-11 20:59:23,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:23,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636084900] [2024-10-11 20:59:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:23,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:59:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 20:59:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 20:59:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:59:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 20:59:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-11 20:59:23,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:23,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636084900] [2024-10-11 20:59:23,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636084900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:23,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:23,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:59:23,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580820165] [2024-10-11 20:59:23,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:23,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:59:23,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:23,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:59:23,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:59:23,519 INFO L87 Difference]: Start difference. First operand 515 states and 606 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:59:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:23,577 INFO L93 Difference]: Finished difference Result 931 states and 1103 transitions. [2024-10-11 20:59:23,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:59:23,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2024-10-11 20:59:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:23,581 INFO L225 Difference]: With dead ends: 931 [2024-10-11 20:59:23,581 INFO L226 Difference]: Without dead ends: 558 [2024-10-11 20:59:23,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-10-11 20:59:23,583 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:23,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 152 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:59:23,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-10-11 20:59:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 521. [2024-10-11 20:59:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 419 states have (on average 1.20763723150358) internal successors, (506), 422 states have internal predecessors, (506), 52 states have call successors, (52), 47 states have call predecessors, (52), 47 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 20:59:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 610 transitions. [2024-10-11 20:59:23,612 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 610 transitions. Word has length 99 [2024-10-11 20:59:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:23,612 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 610 transitions. [2024-10-11 20:59:23,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:59:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 610 transitions. [2024-10-11 20:59:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 20:59:23,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:23,614 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 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-10-11 20:59:23,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:59:23,615 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:23,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:23,615 INFO L85 PathProgramCache]: Analyzing trace with hash -56549618, now seen corresponding path program 2 times [2024-10-11 20:59:23,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:23,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701927303] [2024-10-11 20:59:23,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:23,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:59:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 20:59:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 20:59:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 20:59:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 20:59:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:59:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 20:59:23,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:23,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701927303] [2024-10-11 20:59:23,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701927303] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:23,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706344525] [2024-10-11 20:59:23,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:59:23,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:23,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:23,730 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:23,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:59:23,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:59:23,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:59:23,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 20:59:23,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 189 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 20:59:23,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 89 proven. 3 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-11 20:59:24,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706344525] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:59:24,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:59:24,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 19 [2024-10-11 20:59:24,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321656384] [2024-10-11 20:59:24,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:24,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 20:59:24,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:24,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 20:59:24,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:59:24,095 INFO L87 Difference]: Start difference. First operand 521 states and 610 transitions. Second operand has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 10 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2024-10-11 20:59:24,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:24,509 INFO L93 Difference]: Finished difference Result 826 states and 965 transitions. [2024-10-11 20:59:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 20:59:24,509 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 10 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) Word has length 105 [2024-10-11 20:59:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:24,511 INFO L225 Difference]: With dead ends: 826 [2024-10-11 20:59:24,511 INFO L226 Difference]: Without dead ends: 604 [2024-10-11 20:59:24,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 213 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=377, Invalid=1429, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 20:59:24,513 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 96 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:24,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 396 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:59:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-11 20:59:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 526. [2024-10-11 20:59:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 426 states have (on average 1.1971830985915493) internal successors, (510), 429 states have internal predecessors, (510), 51 states have call successors, (51), 46 states have call predecessors, (51), 46 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 20:59:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 612 transitions. [2024-10-11 20:59:24,544 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 612 transitions. Word has length 105 [2024-10-11 20:59:24,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:24,545 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 612 transitions. [2024-10-11 20:59:24,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 10 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2024-10-11 20:59:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 612 transitions. [2024-10-11 20:59:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 20:59:24,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:24,546 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:24,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 20:59:24,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:59:24,748 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:59:24,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:24,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1522722119, now seen corresponding path program 1 times [2024-10-11 20:59:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:24,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206720783] [2024-10-11 20:59:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 20:59:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:59:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:59:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:59:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:59:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 20:59:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 20:59:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 20:59:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 20:59:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:59:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-10-11 20:59:24,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:24,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206720783] [2024-10-11 20:59:24,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206720783] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:24,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164359687] [2024-10-11 20:59:24,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:24,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:24,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:24,857 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:24,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:59:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:24,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 20:59:24,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 20:59:25,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 59 proven. 4 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-11 20:59:25,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164359687] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:59:25,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:59:25,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 19 [2024-10-11 20:59:25,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104956474] [2024-10-11 20:59:25,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:25,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 20:59:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:25,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 20:59:25,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:59:25,230 INFO L87 Difference]: Start difference. First operand 526 states and 612 transitions. Second operand has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 9 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2024-10-11 20:59:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:26,012 INFO L93 Difference]: Finished difference Result 1021 states and 1176 transitions. [2024-10-11 20:59:26,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-11 20:59:26,012 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 9 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) Word has length 109 [2024-10-11 20:59:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:26,013 INFO L225 Difference]: With dead ends: 1021 [2024-10-11 20:59:26,013 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:59:26,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 222 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=701, Invalid=3331, Unknown=0, NotChecked=0, Total=4032 [2024-10-11 20:59:26,018 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 119 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:26,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 514 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:59:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:59:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:59:26,020 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-10-11 20:59:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:59:26,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2024-10-11 20:59:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:26,021 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:59:26,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 9 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2024-10-11 20:59:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:59:26,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:59:26,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-11 20:59:26,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-11 20:59:26,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-11 20:59:26,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-11 20:59:26,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-11 20:59:26,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-11 20:59:26,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 20:59:26,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:26,229 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:26,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:59:27,886 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:59:27,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:59:27 BoogieIcfgContainer [2024-10-11 20:59:27,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:59:27,901 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:59:27,901 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:59:27,901 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:59:27,901 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:59:10" (3/4) ... [2024-10-11 20:59:27,902 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:59:27,905 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 20:59:27,905 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:59:27,908 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-10-11 20:59:27,908 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 20:59:27,908 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:59:27,908 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:59:27,909 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:59:27,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:59:27,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:59:27,984 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:59:27,985 INFO L158 Benchmark]: Toolchain (without parser) took 18167.03ms. Allocated memory was 163.6MB in the beginning and 358.6MB in the end (delta: 195.0MB). Free memory was 90.1MB in the beginning and 189.0MB in the end (delta: -98.9MB). Peak memory consumption was 97.1MB. Max. memory is 16.1GB. [2024-10-11 20:59:27,985 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 163.6MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:59:27,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.40ms. Allocated memory is still 163.6MB. Free memory was 89.8MB in the beginning and 77.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:59:27,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.28ms. Allocated memory is still 163.6MB. Free memory was 77.4MB in the beginning and 75.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:59:27,986 INFO L158 Benchmark]: Boogie Preprocessor took 30.85ms. Allocated memory is still 163.6MB. Free memory was 75.7MB in the beginning and 73.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:59:27,986 INFO L158 Benchmark]: RCFGBuilder took 320.65ms. Allocated memory was 163.6MB in the beginning and 205.5MB in the end (delta: 41.9MB). Free memory was 73.9MB in the beginning and 165.5MB in the end (delta: -91.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 20:59:27,986 INFO L158 Benchmark]: TraceAbstraction took 17451.16ms. Allocated memory was 205.5MB in the beginning and 358.6MB in the end (delta: 153.1MB). Free memory was 165.5MB in the beginning and 194.2MB in the end (delta: -28.7MB). Peak memory consumption was 208.3MB. Max. memory is 16.1GB. [2024-10-11 20:59:27,986 INFO L158 Benchmark]: Witness Printer took 83.97ms. Allocated memory is still 358.6MB. Free memory was 194.2MB in the beginning and 189.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:59:27,988 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.11ms. Allocated memory is still 163.6MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.40ms. Allocated memory is still 163.6MB. Free memory was 89.8MB in the beginning and 77.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.28ms. Allocated memory is still 163.6MB. Free memory was 77.4MB in the beginning and 75.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.85ms. Allocated memory is still 163.6MB. Free memory was 75.7MB in the beginning and 73.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 320.65ms. Allocated memory was 163.6MB in the beginning and 205.5MB in the end (delta: 41.9MB). Free memory was 73.9MB in the beginning and 165.5MB in the end (delta: -91.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17451.16ms. Allocated memory was 205.5MB in the beginning and 358.6MB in the end (delta: 153.1MB). Free memory was 165.5MB in the beginning and 194.2MB in the end (delta: -28.7MB). Peak memory consumption was 208.3MB. Max. memory is 16.1GB. * Witness Printer took 83.97ms. Allocated memory is still 358.6MB. Free memory was 194.2MB in the beginning and 189.0MB 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: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: 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, 42 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 15.7s, OverallIterations: 19, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1745 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1741 mSDsluCounter, 5129 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4352 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4362 IncrementalHoareTripleChecker+Invalid, 4610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 777 mSDtfsCounter, 4362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2288 GetRequests, 1690 SyntacticMatches, 47 SemanticMatches, 551 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6822 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=526occurred in iteration=18, InterpolantAutomatonStates: 447, 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, 19 MinimizatonAttempts, 596 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1997 NumberOfCodeBlocks, 1997 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2712 ConstructedInterpolants, 0 QuantifiedInterpolants, 5578 SizeOfPredicates, 92 NumberOfNonLiveVariables, 1986 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 40 InterpolantComputations, 9 PerfectInterpolantSequences, 3136/3687 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 6 specifications checked. All of them hold - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (((((2 <= counter) && (counter <= 6)) && (((long long) x + 1) <= y)) || ((counter < 9) && (3 <= counter))) || ((6 <= counter) && (counter <= 2147483645))) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((counter <= 2147483646) && (3 <= counter)) || (counter == 0)) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((((counter <= 9) && (5 <= counter)) || ((x != y) && (counter == 1))) || ((2 <= counter) && (counter <= 6))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (counter == 0) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:59:28,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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