./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69e3759b6e7ee15378e7391ad11d943bae32b67ab55c3e2fea94db5284daa3ec --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:46:03,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:46:03,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:46:03,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:46:03,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:46:03,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:46:03,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:46:03,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:46:03,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:46:03,211 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:46:03,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:46:03,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:46:03,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:46:03,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:46:03,212 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:46:03,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:46:03,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:46:03,213 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:46:03,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:46:03,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:46:03,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:46:03,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:46:03,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:46:03,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:46:03,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:46:03,216 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:46:03,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:46:03,216 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:46:03,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:46:03,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:46:03,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:46:03,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:46:03,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:46:03,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:46:03,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:46:03,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:46:03,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:46:03,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:46:03,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:46:03,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:46:03,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:46:03,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:46:03,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:46:03,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:46:03,220 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69e3759b6e7ee15378e7391ad11d943bae32b67ab55c3e2fea94db5284daa3ec [2024-11-12 17:46:03,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:46:03,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:46:03,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:46:03,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:46:03,454 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:46:03,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound2.c [2024-11-12 17:46:04,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:46:04,971 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:46:04,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound2.c [2024-11-12 17:46:04,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ccfc7a3/20bcb79c839d498188aad90ee7539250/FLAG5a2297785 [2024-11-12 17:46:05,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ccfc7a3/20bcb79c839d498188aad90ee7539250 [2024-11-12 17:46:05,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:46:05,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:46:05,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:46:05,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:46:05,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:46:05,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575693ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05, skipping insertion in model container [2024-11-12 17:46:05,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:46:05,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:46:05,570 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:46:05,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:46:05,604 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:46:05,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05 WrapperNode [2024-11-12 17:46:05,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:46:05,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:46:05,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:46:05,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:46:05,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,637 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-11-12 17:46:05,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:46:05,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:46:05,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:46:05,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:46:05,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,683 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 17:46:05,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:46:05,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:46:05,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:46:05,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:46:05,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05" (1/1) ... [2024-11-12 17:46:05,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:46:05,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:46:05,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 17:46:05,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 17:46:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:46:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:46:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:46:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:46:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 17:46:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 17:46:05,823 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:46:05,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:46:06,140 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-12 17:46:06,140 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:46:06,169 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:46:06,169 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 17:46:06,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:46:06 BoogieIcfgContainer [2024-11-12 17:46:06,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:46:06,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:46:06,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:46:06,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:46:06,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:46:05" (1/3) ... [2024-11-12 17:46:06,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4760b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:46:06, skipping insertion in model container [2024-11-12 17:46:06,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:46:05" (2/3) ... [2024-11-12 17:46:06,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4760b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:46:06, skipping insertion in model container [2024-11-12 17:46:06,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:46:06" (3/3) ... [2024-11-12 17:46:06,175 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound2.c [2024-11-12 17:46:06,192 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:46:06,192 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-11-12 17:46:06,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:46:06,255 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;@36074a4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:46:06,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-12 17:46:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 64 states have (on average 1.859375) internal successors, (119), 114 states have internal predecessors, (119), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 17:46:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 17:46:06,262 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:06,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 17:46:06,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:06,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash 889508909, now seen corresponding path program 1 times [2024-11-12 17:46:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:06,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352978102] [2024-11-12 17:46:06,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:06,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:06,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:46:06,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:06,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352978102] [2024-11-12 17:46:06,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352978102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:46:06,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:46:06,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:46:06,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281517813] [2024-11-12 17:46:06,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:46:06,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 17:46:06,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:06,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 17:46:06,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 17:46:06,409 INFO L87 Difference]: Start difference. First operand has 122 states, 64 states have (on average 1.859375) internal successors, (119), 114 states have internal predecessors, (119), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:46:06,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:06,437 INFO L93 Difference]: Finished difference Result 236 states and 263 transitions. [2024-11-12 17:46:06,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 17:46:06,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2024-11-12 17:46:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:06,445 INFO L225 Difference]: With dead ends: 236 [2024-11-12 17:46:06,446 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 17:46:06,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11-12 17:46:06,451 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:06,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:46:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 17:46:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-12 17:46:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 59 states have (on average 1.7796610169491525) internal successors, (105), 104 states have internal predecessors, (105), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 17:46:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2024-11-12 17:46:06,480 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 6 [2024-11-12 17:46:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:06,481 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2024-11-12 17:46:06,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:46:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2024-11-12 17:46:06,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 17:46:06,482 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:06,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 17:46:06,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:46:06,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:06,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash 889568486, now seen corresponding path program 1 times [2024-11-12 17:46:06,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:06,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222268923] [2024-11-12 17:46:06,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:46:06,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:06,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222268923] [2024-11-12 17:46:06,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222268923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:46:06,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:46:06,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:46:06,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676121858] [2024-11-12 17:46:06,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:46:06,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:46:06,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:06,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:46:06,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:46:06,592 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:46:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:06,696 INFO L93 Difference]: Finished difference Result 206 states and 215 transitions. [2024-11-12 17:46:06,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:46:06,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2024-11-12 17:46:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:06,698 INFO L225 Difference]: With dead ends: 206 [2024-11-12 17:46:06,698 INFO L226 Difference]: Without dead ends: 186 [2024-11-12 17:46:06,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:46:06,699 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:06,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 164 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:46:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-12 17:46:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2024-11-12 17:46:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 140 states have internal predecessors, (153), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 17:46:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2024-11-12 17:46:06,712 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 6 [2024-11-12 17:46:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:06,713 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2024-11-12 17:46:06,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:46:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2024-11-12 17:46:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 17:46:06,714 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:06,715 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:06,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 17:46:06,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:06,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1295434416, now seen corresponding path program 1 times [2024-11-12 17:46:06,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:06,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292146966] [2024-11-12 17:46:06,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:06,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:46:06,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823220887] [2024-11-12 17:46:06,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:06,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:06,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:46:06,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:46:06,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 17:46:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:06,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:46:06,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:46:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:46:06,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:46:06,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:06,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292146966] [2024-11-12 17:46:06,849 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:46:06,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823220887] [2024-11-12 17:46:06,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823220887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:46:06,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:46:06,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:46:06,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235142939] [2024-11-12 17:46:06,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:46:06,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:46:06,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:06,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:46:06,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:46:06,851 INFO L87 Difference]: Start difference. First operand 151 states and 171 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:46:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:06,940 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2024-11-12 17:46:06,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:46:06,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-12 17:46:06,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:06,942 INFO L225 Difference]: With dead ends: 178 [2024-11-12 17:46:06,944 INFO L226 Difference]: Without dead ends: 170 [2024-11-12 17:46:06,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:46:06,946 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 41 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:06,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 150 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:46:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-12 17:46:06,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2024-11-12 17:46:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 105 states have (on average 1.561904761904762) internal successors, (164), 150 states have internal predecessors, (164), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 17:46:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 184 transitions. [2024-11-12 17:46:06,962 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 184 transitions. Word has length 27 [2024-11-12 17:46:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:06,963 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 184 transitions. [2024-11-12 17:46:06,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:46:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 184 transitions. [2024-11-12 17:46:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 17:46:06,964 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:06,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:06,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 17:46:07,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:07,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:07,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1503761308, now seen corresponding path program 1 times [2024-11-12 17:46:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:07,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837590876] [2024-11-12 17:46:07,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:07,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 17:46:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:07,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:46:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:46:07,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:07,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837590876] [2024-11-12 17:46:07,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837590876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:46:07,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:46:07,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:46:07,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949452138] [2024-11-12 17:46:07,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:46:07,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:46:07,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:07,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:46:07,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:46:07,290 INFO L87 Difference]: Start difference. First operand 162 states and 184 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:46:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:07,367 INFO L93 Difference]: Finished difference Result 178 states and 195 transitions. [2024-11-12 17:46:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:46:07,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-12 17:46:07,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:07,369 INFO L225 Difference]: With dead ends: 178 [2024-11-12 17:46:07,369 INFO L226 Difference]: Without dead ends: 168 [2024-11-12 17:46:07,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:46:07,370 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 38 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:07,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 164 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:46:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-12 17:46:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2024-11-12 17:46:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 108 states have (on average 1.4814814814814814) internal successors, (160), 153 states have internal predecessors, (160), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 17:46:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 180 transitions. [2024-11-12 17:46:07,379 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 180 transitions. Word has length 28 [2024-11-12 17:46:07,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:07,379 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 180 transitions. [2024-11-12 17:46:07,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:46:07,380 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 180 transitions. [2024-11-12 17:46:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 17:46:07,380 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:07,380 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:07,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 17:46:07,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:07,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:07,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2044306868, now seen corresponding path program 1 times [2024-11-12 17:46:07,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:07,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487410126] [2024-11-12 17:46:07,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:07,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:07,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 17:46:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:07,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:46:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:46:07,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:07,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487410126] [2024-11-12 17:46:07,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487410126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:46:07,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:46:07,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:46:07,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757511018] [2024-11-12 17:46:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:46:07,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:46:07,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:07,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:46:07,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:46:07,480 INFO L87 Difference]: Start difference. First operand 165 states and 180 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:46:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:07,591 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2024-11-12 17:46:07,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:46:07,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-12 17:46:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:07,593 INFO L225 Difference]: With dead ends: 170 [2024-11-12 17:46:07,593 INFO L226 Difference]: Without dead ends: 168 [2024-11-12 17:46:07,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-12 17:46:07,594 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 80 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:07,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 156 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:46:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-12 17:46:07,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2024-11-12 17:46:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 108 states have (on average 1.462962962962963) internal successors, (158), 153 states have internal predecessors, (158), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 17:46:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2024-11-12 17:46:07,604 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 31 [2024-11-12 17:46:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:07,604 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2024-11-12 17:46:07,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:46:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2024-11-12 17:46:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 17:46:07,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:07,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:07,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 17:46:07,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:07,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash 76490936, now seen corresponding path program 1 times [2024-11-12 17:46:07,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:07,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443915790] [2024-11-12 17:46:07,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:07,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:07,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 17:46:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:07,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:46:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:46:07,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:07,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443915790] [2024-11-12 17:46:07,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443915790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:46:07,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:46:07,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:46:07,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705932285] [2024-11-12 17:46:07,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:46:07,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:46:07,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:07,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:46:07,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:46:07,693 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:46:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:07,779 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2024-11-12 17:46:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:46:07,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-12 17:46:07,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:07,781 INFO L225 Difference]: With dead ends: 170 [2024-11-12 17:46:07,781 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 17:46:07,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:46:07,783 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:07,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 146 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:46:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 17:46:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-12 17:46:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.528735632183908) internal successors, (133), 132 states have internal predecessors, (133), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 17:46:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2024-11-12 17:46:07,794 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 35 [2024-11-12 17:46:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:07,794 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2024-11-12 17:46:07,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:46:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2024-11-12 17:46:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 17:46:07,795 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:07,795 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:07,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 17:46:07,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:07,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1341873330, now seen corresponding path program 1 times [2024-11-12 17:46:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:07,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789766494] [2024-11-12 17:46:07,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:07,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:07,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 17:46:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:07,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:46:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:07,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:46:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:46:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789766494] [2024-11-12 17:46:07,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789766494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:46:07,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:46:07,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:46:07,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525574412] [2024-11-12 17:46:07,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:46:07,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:46:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:07,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:46:07,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:46:07,937 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 17:46:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:08,033 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2024-11-12 17:46:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:46:08,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-12 17:46:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:08,037 INFO L225 Difference]: With dead ends: 145 [2024-11-12 17:46:08,037 INFO L226 Difference]: Without dead ends: 144 [2024-11-12 17:46:08,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:46:08,038 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:08,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 210 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:46:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-12 17:46:08,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-12 17:46:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 88 states have (on average 1.5227272727272727) internal successors, (134), 133 states have internal predecessors, (134), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 17:46:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2024-11-12 17:46:08,046 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 48 [2024-11-12 17:46:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:08,046 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2024-11-12 17:46:08,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 17:46:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2024-11-12 17:46:08,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 17:46:08,047 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:08,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:08,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 17:46:08,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:08,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1351599618, now seen corresponding path program 1 times [2024-11-12 17:46:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:08,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526299419] [2024-11-12 17:46:08,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:08,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 17:46:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:46:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:46:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:46:08,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:08,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526299419] [2024-11-12 17:46:08,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526299419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:46:08,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:46:08,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:46:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587525602] [2024-11-12 17:46:08,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:46:08,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:46:08,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:08,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:46:08,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:46:08,157 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 17:46:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:08,242 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2024-11-12 17:46:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:46:08,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-12 17:46:08,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:08,243 INFO L225 Difference]: With dead ends: 145 [2024-11-12 17:46:08,244 INFO L226 Difference]: Without dead ends: 144 [2024-11-12 17:46:08,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-11-12 17:46:08,245 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:08,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:46:08,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-12 17:46:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-12 17:46:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 134 states have internal predecessors, (135), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 17:46:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2024-11-12 17:46:08,249 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 49 [2024-11-12 17:46:08,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:08,249 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2024-11-12 17:46:08,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 17:46:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2024-11-12 17:46:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 17:46:08,250 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:08,250 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:08,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 17:46:08,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:08,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:08,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1807107968, now seen corresponding path program 1 times [2024-11-12 17:46:08,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:08,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011998063] [2024-11-12 17:46:08,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:08,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 17:46:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:46:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:46:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:46:08,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:08,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011998063] [2024-11-12 17:46:08,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011998063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:46:08,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464050010] [2024-11-12 17:46:08,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:08,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:08,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:46:08,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:46:08,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 17:46:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:46:08,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:46:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:46:08,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:46:08,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464050010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:46:08,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:46:08,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-12 17:46:08,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287718558] [2024-11-12 17:46:08,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:46:08,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:46:08,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:08,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:46:08,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:46:08,446 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 17:46:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:08,507 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2024-11-12 17:46:08,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:46:08,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-11-12 17:46:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:08,508 INFO L225 Difference]: With dead ends: 144 [2024-11-12 17:46:08,508 INFO L226 Difference]: Without dead ends: 135 [2024-11-12 17:46:08,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:46:08,509 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 120 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:08,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 120 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:46:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-12 17:46:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-12 17:46:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 125 states have internal predecessors, (126), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 17:46:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2024-11-12 17:46:08,513 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 51 [2024-11-12 17:46:08,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:08,514 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2024-11-12 17:46:08,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 17:46:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2024-11-12 17:46:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 17:46:08,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:08,515 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:08,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 17:46:08,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-12 17:46:08,716 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:08,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:08,716 INFO L85 PathProgramCache]: Analyzing trace with hash -185772108, now seen corresponding path program 1 times [2024-11-12 17:46:08,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:08,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132595955] [2024-11-12 17:46:08,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:08,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 17:46:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:46:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:46:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:46:08,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:08,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132595955] [2024-11-12 17:46:08,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132595955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:46:08,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858755357] [2024-11-12 17:46:08,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:08,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:08,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:46:08,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:46:08,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 17:46:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:08,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:46:08,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:46:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:46:08,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:46:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:46:09,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858755357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:46:09,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:46:09,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-12 17:46:09,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009659569] [2024-11-12 17:46:09,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:46:09,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 17:46:09,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:09,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 17:46:09,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:46:09,059 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-12 17:46:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:09,213 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2024-11-12 17:46:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:46:09,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 52 [2024-11-12 17:46:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:09,214 INFO L225 Difference]: With dead ends: 230 [2024-11-12 17:46:09,215 INFO L226 Difference]: Without dead ends: 221 [2024-11-12 17:46:09,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:46:09,216 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 175 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:09,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 262 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:46:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-12 17:46:09,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 126. [2024-11-12 17:46:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 116 states have internal predecessors, (117), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 17:46:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2024-11-12 17:46:09,227 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 52 [2024-11-12 17:46:09,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:09,228 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2024-11-12 17:46:09,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-12 17:46:09,229 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2024-11-12 17:46:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 17:46:09,231 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:09,231 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:09,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 17:46:09,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:09,435 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:09,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1650363250, now seen corresponding path program 1 times [2024-11-12 17:46:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:09,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130454196] [2024-11-12 17:46:09,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:09,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:46:09,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044129178] [2024-11-12 17:46:09,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:09,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:09,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:46:09,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:46:09,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 17:46:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:09,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:46:09,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:46:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 17:46:09,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:46:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 17:46:09,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:09,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130454196] [2024-11-12 17:46:09,717 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:46:09,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044129178] [2024-11-12 17:46:09,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044129178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:46:09,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 17:46:09,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-12 17:46:09,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987034812] [2024-11-12 17:46:09,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 17:46:09,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:46:09,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:09,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:46:09,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:46:09,719 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-12 17:46:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:09,882 INFO L93 Difference]: Finished difference Result 305 states and 327 transitions. [2024-11-12 17:46:09,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:46:09,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 65 [2024-11-12 17:46:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:09,888 INFO L225 Difference]: With dead ends: 305 [2024-11-12 17:46:09,888 INFO L226 Difference]: Without dead ends: 303 [2024-11-12 17:46:09,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:46:09,889 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 340 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:09,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 311 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:46:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-12 17:46:09,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 203. [2024-11-12 17:46:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 160 states have (on average 1.36875) internal successors, (219), 186 states have internal predecessors, (219), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 17:46:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2024-11-12 17:46:09,898 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 65 [2024-11-12 17:46:09,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:09,899 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2024-11-12 17:46:09,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-12 17:46:09,899 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2024-11-12 17:46:09,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 17:46:09,900 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:09,900 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:09,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 17:46:10,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:10,105 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:10,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash 809495382, now seen corresponding path program 1 times [2024-11-12 17:46:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:10,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914124390] [2024-11-12 17:46:10,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:10,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:46:10,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [342920332] [2024-11-12 17:46:10,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:10,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:10,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:46:10,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:46:10,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 17:46:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:10,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:46:10,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:46:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:46:10,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:46:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:46:10,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:10,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914124390] [2024-11-12 17:46:10,328 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:46:10,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342920332] [2024-11-12 17:46:10,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342920332] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:46:10,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 17:46:10,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-12 17:46:10,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770011724] [2024-11-12 17:46:10,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 17:46:10,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:46:10,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:10,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:46:10,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:46:10,329 INFO L87 Difference]: Start difference. First operand 203 states and 249 transitions. Second operand has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-12 17:46:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:10,518 INFO L93 Difference]: Finished difference Result 263 states and 326 transitions. [2024-11-12 17:46:10,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:46:10,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 72 [2024-11-12 17:46:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:10,520 INFO L225 Difference]: With dead ends: 263 [2024-11-12 17:46:10,520 INFO L226 Difference]: Without dead ends: 255 [2024-11-12 17:46:10,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:46:10,521 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 177 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:10,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 228 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:46:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-12 17:46:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 199. [2024-11-12 17:46:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 181 states have internal predecessors, (204), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 17:46:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2024-11-12 17:46:10,530 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 72 [2024-11-12 17:46:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:10,530 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2024-11-12 17:46:10,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-12 17:46:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2024-11-12 17:46:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-12 17:46:10,531 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:10,531 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:10,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-12 17:46:10,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-12 17:46:10,733 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:10,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:10,733 INFO L85 PathProgramCache]: Analyzing trace with hash -675446858, now seen corresponding path program 1 times [2024-11-12 17:46:10,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:10,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45220928] [2024-11-12 17:46:10,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:10,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:10,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 17:46:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:46:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:10,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:46:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:10,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:46:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:10,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 17:46:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:46:10,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:10,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45220928] [2024-11-12 17:46:10,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45220928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:46:10,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657517484] [2024-11-12 17:46:10,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:10,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:10,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:46:10,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:46:10,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 17:46:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:10,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:46:10,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:46:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:46:11,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:46:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:46:11,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657517484] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:46:11,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:46:11,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-12 17:46:11,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173449340] [2024-11-12 17:46:11,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:46:11,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 17:46:11,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:11,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 17:46:11,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:46:11,107 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand has 10 states, 9 states have (on average 14.11111111111111) internal successors, (127), 10 states have internal predecessors, (127), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-12 17:46:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:11,384 INFO L93 Difference]: Finished difference Result 199 states and 236 transitions. [2024-11-12 17:46:11,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:46:11,385 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.11111111111111) internal successors, (127), 10 states have internal predecessors, (127), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 73 [2024-11-12 17:46:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:11,386 INFO L225 Difference]: With dead ends: 199 [2024-11-12 17:46:11,386 INFO L226 Difference]: Without dead ends: 196 [2024-11-12 17:46:11,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:46:11,387 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 90 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:11,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 212 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 17:46:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-12 17:46:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-12 17:46:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 162 states have (on average 1.2160493827160495) internal successors, (197), 178 states have internal predecessors, (197), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 17:46:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2024-11-12 17:46:11,395 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 73 [2024-11-12 17:46:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:11,395 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2024-11-12 17:46:11,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.11111111111111) internal successors, (127), 10 states have internal predecessors, (127), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-12 17:46:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2024-11-12 17:46:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-12 17:46:11,396 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:11,396 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:11,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 17:46:11,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:11,601 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:11,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:11,602 INFO L85 PathProgramCache]: Analyzing trace with hash 535983960, now seen corresponding path program 1 times [2024-11-12 17:46:11,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:11,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469758636] [2024-11-12 17:46:11,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:11,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:11,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 17:46:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:11,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:46:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:46:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:46:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:11,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 17:46:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:46:11,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:11,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469758636] [2024-11-12 17:46:11,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469758636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:46:11,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487017947] [2024-11-12 17:46:11,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:11,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:11,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:46:11,696 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:46:11,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 17:46:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:11,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:46:11,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:46:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:46:11,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:46:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:46:11,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487017947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:46:11,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:46:11,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-12 17:46:11,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065918594] [2024-11-12 17:46:11,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:46:11,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 17:46:11,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:11,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 17:46:11,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:46:11,905 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand has 10 states, 9 states have (on average 14.333333333333334) internal successors, (129), 10 states have internal predecessors, (129), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-12 17:46:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:12,069 INFO L93 Difference]: Finished difference Result 222 states and 261 transitions. [2024-11-12 17:46:12,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:46:12,069 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.333333333333334) internal successors, (129), 10 states have internal predecessors, (129), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 74 [2024-11-12 17:46:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:12,070 INFO L225 Difference]: With dead ends: 222 [2024-11-12 17:46:12,070 INFO L226 Difference]: Without dead ends: 213 [2024-11-12 17:46:12,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2024-11-12 17:46:12,071 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 155 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:12,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 206 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:46:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-12 17:46:12,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 189. [2024-11-12 17:46:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 162 states have (on average 1.117283950617284) internal successors, (181), 171 states have internal predecessors, (181), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 17:46:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2024-11-12 17:46:12,078 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 74 [2024-11-12 17:46:12,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:12,078 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2024-11-12 17:46:12,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.333333333333334) internal successors, (129), 10 states have internal predecessors, (129), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-12 17:46:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2024-11-12 17:46:12,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-12 17:46:12,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:12,079 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:12,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-12 17:46:12,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:12,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:12,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash -315487398, now seen corresponding path program 1 times [2024-11-12 17:46:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316392110] [2024-11-12 17:46:12,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:12,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 17:46:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:46:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:46:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:46:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 17:46:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:46:12,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:12,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316392110] [2024-11-12 17:46:12,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316392110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:46:12,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179661926] [2024-11-12 17:46:12,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:12,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:12,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:46:12,367 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:46:12,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 17:46:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 17:46:12,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:46:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:46:12,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:46:12,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179661926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:46:12,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:46:12,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-12 17:46:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590354332] [2024-11-12 17:46:12,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:46:12,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:46:12,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:12,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:46:12,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:46:12,545 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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-11-12 17:46:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:12,621 INFO L93 Difference]: Finished difference Result 189 states and 213 transitions. [2024-11-12 17:46:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:46:12,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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 76 [2024-11-12 17:46:12,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:12,622 INFO L225 Difference]: With dead ends: 189 [2024-11-12 17:46:12,622 INFO L226 Difference]: Without dead ends: 159 [2024-11-12 17:46:12,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:46:12,623 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 35 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:12,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 137 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:46:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-12 17:46:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-12 17:46:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 140 states have (on average 1.0357142857142858) internal successors, (145), 143 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 17:46:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2024-11-12 17:46:12,629 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 76 [2024-11-12 17:46:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:12,629 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2024-11-12 17:46:12,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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-11-12 17:46:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2024-11-12 17:46:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 17:46:12,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:12,630 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2024-11-12 17:46:12,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 17:46:12,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 17:46:12,834 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:12,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:12,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1290551230, now seen corresponding path program 1 times [2024-11-12 17:46:12,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:12,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712141410] [2024-11-12 17:46:12,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:12,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 17:46:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:46:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:46:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:46:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 17:46:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 17:46:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 17:46:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:12,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 17:46:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 17:46:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 17:46:13,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:13,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712141410] [2024-11-12 17:46:13,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712141410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:46:13,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192436300] [2024-11-12 17:46:13,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:13,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:13,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:46:13,006 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:46:13,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 17:46:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:13,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 17:46:13,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:46:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 17:46:13,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:46:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 17:46:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192436300] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:46:13,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:46:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-11-12 17:46:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759412274] [2024-11-12 17:46:13,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:46:13,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 17:46:13,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:13,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 17:46:13,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2024-11-12 17:46:13,524 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand has 20 states, 19 states have (on average 14.68421052631579) internal successors, (279), 20 states have internal predecessors, (279), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-11-12 17:46:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:13,784 INFO L93 Difference]: Finished difference Result 246 states and 274 transitions. [2024-11-12 17:46:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 17:46:13,784 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 14.68421052631579) internal successors, (279), 20 states have internal predecessors, (279), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 139 [2024-11-12 17:46:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:13,786 INFO L225 Difference]: With dead ends: 246 [2024-11-12 17:46:13,786 INFO L226 Difference]: Without dead ends: 245 [2024-11-12 17:46:13,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2024-11-12 17:46:13,787 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:13,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 254 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:46:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-12 17:46:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2024-11-12 17:46:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 217 states have (on average 1.0506912442396312) internal successors, (228), 220 states have internal predecessors, (228), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 17:46:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 270 transitions. [2024-11-12 17:46:13,799 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 270 transitions. Word has length 139 [2024-11-12 17:46:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:13,799 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 270 transitions. [2024-11-12 17:46:13,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 14.68421052631579) internal successors, (279), 20 states have internal predecessors, (279), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-11-12 17:46:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 270 transitions. [2024-11-12 17:46:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 17:46:13,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:13,802 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2024-11-12 17:46:13,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-12 17:46:14,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-12 17:46:14,003 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:14,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:14,003 INFO L85 PathProgramCache]: Analyzing trace with hash 127166872, now seen corresponding path program 2 times [2024-11-12 17:46:14,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:14,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299540072] [2024-11-12 17:46:14,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:14,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:14,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 17:46:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:14,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:46:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:14,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:46:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:14,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:46:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 17:46:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:14,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 17:46:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:14,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 17:46:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:14,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 17:46:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:14,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 17:46:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:14,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 17:46:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:14,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 17:46:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 17:46:14,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:14,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299540072] [2024-11-12 17:46:14,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299540072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:46:14,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356702460] [2024-11-12 17:46:14,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:46:14,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:14,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:46:14,308 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:46:14,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-12 17:46:14,362 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 17:46:14,363 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:46:14,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 17:46:14,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:46:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 17:46:14,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:46:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 17:46:14,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356702460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:46:14,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:46:14,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2024-11-12 17:46:14,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12766386] [2024-11-12 17:46:14,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:46:14,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 17:46:14,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:14,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 17:46:14,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2024-11-12 17:46:14,843 INFO L87 Difference]: Start difference. First operand 243 states and 270 transitions. Second operand has 22 states, 21 states have (on average 14.714285714285714) internal successors, (309), 22 states have internal predecessors, (309), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-12 17:46:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:15,139 INFO L93 Difference]: Finished difference Result 265 states and 292 transitions. [2024-11-12 17:46:15,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 17:46:15,140 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 14.714285714285714) internal successors, (309), 22 states have internal predecessors, (309), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 164 [2024-11-12 17:46:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:15,141 INFO L225 Difference]: With dead ends: 265 [2024-11-12 17:46:15,141 INFO L226 Difference]: Without dead ends: 264 [2024-11-12 17:46:15,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2024-11-12 17:46:15,142 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 88 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:15,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 272 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:46:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-12 17:46:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2024-11-12 17:46:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 232 states have (on average 1.043103448275862) internal successors, (242), 235 states have internal predecessors, (242), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 17:46:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 288 transitions. [2024-11-12 17:46:15,150 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 288 transitions. Word has length 164 [2024-11-12 17:46:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:15,151 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 288 transitions. [2024-11-12 17:46:15,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 14.714285714285714) internal successors, (309), 22 states have internal predecessors, (309), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-12 17:46:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 288 transitions. [2024-11-12 17:46:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-12 17:46:15,152 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:46:15,152 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-11-12 17:46:15,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-12 17:46:15,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-12 17:46:15,357 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-11-12 17:46:15,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:46:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1781711604, now seen corresponding path program 2 times [2024-11-12 17:46:15,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:46:15,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389723811] [2024-11-12 17:46:15,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:46:15,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:46:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 17:46:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:46:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:46:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:46:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 17:46:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 17:46:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 17:46:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 17:46:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 17:46:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 17:46:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 17:46:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 17:46:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-12 17:46:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:46:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 66 proven. 180 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 17:46:15,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:46:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389723811] [2024-11-12 17:46:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389723811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:46:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288496595] [2024-11-12 17:46:15,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:46:15,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:46:15,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:46:15,722 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:46:15,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-12 17:46:15,778 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 17:46:15,778 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:46:15,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 17:46:15,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:46:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 213 proven. 81 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 17:46:16,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:46:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 66 proven. 180 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 17:46:16,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288496595] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:46:16,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:46:16,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-12 17:46:16,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253059116] [2024-11-12 17:46:16,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:46:16,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 17:46:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:46:16,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 17:46:16,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2024-11-12 17:46:16,715 INFO L87 Difference]: Start difference. First operand 260 states and 288 transitions. Second operand has 28 states, 28 states have (on average 13.392857142857142) internal successors, (375), 28 states have internal predecessors, (375), 13 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2024-11-12 17:46:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:46:16,849 INFO L93 Difference]: Finished difference Result 264 states and 291 transitions. [2024-11-12 17:46:16,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:46:16,855 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 13.392857142857142) internal successors, (375), 28 states have internal predecessors, (375), 13 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) Word has length 200 [2024-11-12 17:46:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:46:16,855 INFO L225 Difference]: With dead ends: 264 [2024-11-12 17:46:16,855 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 17:46:16,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2024-11-12 17:46:16,856 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:46:16,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:46:16,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 17:46:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 17:46:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:46:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 17:46:16,857 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 200 [2024-11-12 17:46:16,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:46:16,857 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 17:46:16,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 13.392857142857142) internal successors, (375), 28 states have internal predecessors, (375), 13 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2024-11-12 17:46:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 17:46:16,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 17:46:16,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 50 remaining) [2024-11-12 17:46:16,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 50 remaining) [2024-11-12 17:46:16,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 50 remaining) [2024-11-12 17:46:16,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 50 remaining) [2024-11-12 17:46:16,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 50 remaining) [2024-11-12 17:46:16,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 50 remaining) [2024-11-12 17:46:16,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 50 remaining) [2024-11-12 17:46:16,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 50 remaining) [2024-11-12 17:46:16,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 50 remaining) [2024-11-12 17:46:16,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 50 remaining) [2024-11-12 17:46:16,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 50 remaining) [2024-11-12 17:46:16,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 50 remaining) [2024-11-12 17:46:16,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 50 remaining) [2024-11-12 17:46:16,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 50 remaining) [2024-11-12 17:46:16,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 50 remaining) [2024-11-12 17:46:16,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 50 remaining) [2024-11-12 17:46:16,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 50 remaining) [2024-11-12 17:46:16,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 50 remaining) [2024-11-12 17:46:16,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 50 remaining) [2024-11-12 17:46:16,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 50 remaining) [2024-11-12 17:46:16,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 50 remaining) [2024-11-12 17:46:16,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 50 remaining) [2024-11-12 17:46:16,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 50 remaining) [2024-11-12 17:46:16,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 50 remaining) [2024-11-12 17:46:16,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 50 remaining) [2024-11-12 17:46:16,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 50 remaining) [2024-11-12 17:46:16,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 50 remaining) [2024-11-12 17:46:16,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 50 remaining) [2024-11-12 17:46:16,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 50 remaining) [2024-11-12 17:46:16,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 50 remaining) [2024-11-12 17:46:16,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 50 remaining) [2024-11-12 17:46:16,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 50 remaining) [2024-11-12 17:46:16,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 50 remaining) [2024-11-12 17:46:16,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 50 remaining) [2024-11-12 17:46:16,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 50 remaining) [2024-11-12 17:46:16,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-12 17:46:17,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 17:46:17,080 INFO L421 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:46:17,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 17:46:17,678 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:46:17,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:46:17 BoogieIcfgContainer [2024-11-12 17:46:17,712 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:46:17,712 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:46:17,713 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:46:17,713 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:46:17,713 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:46:06" (3/4) ... [2024-11-12 17:46:17,715 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 17:46:17,722 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-12 17:46:17,729 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-12 17:46:17,734 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 17:46:17,734 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 17:46:17,734 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 17:46:17,873 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:46:17,875 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 17:46:17,875 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:46:17,875 INFO L158 Benchmark]: Toolchain (without parser) took 12528.36ms. Allocated memory was 146.8MB in the beginning and 323.0MB in the end (delta: 176.2MB). Free memory was 76.7MB in the beginning and 262.0MB in the end (delta: -185.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:46:17,877 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 146.8MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:46:17,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.68ms. Allocated memory is still 146.8MB. Free memory was 76.3MB in the beginning and 64.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 17:46:17,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.81ms. Allocated memory is still 146.8MB. Free memory was 64.1MB in the beginning and 62.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:46:17,877 INFO L158 Benchmark]: Boogie Preprocessor took 53.61ms. Allocated memory is still 146.8MB. Free memory was 62.0MB in the beginning and 60.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:46:17,878 INFO L158 Benchmark]: RCFGBuilder took 473.13ms. Allocated memory was 146.8MB in the beginning and 222.3MB in the end (delta: 75.5MB). Free memory was 60.5MB in the beginning and 189.9MB in the end (delta: -129.3MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-12 17:46:17,879 INFO L158 Benchmark]: TraceAbstraction took 11541.22ms. Allocated memory was 222.3MB in the beginning and 323.0MB in the end (delta: 100.7MB). Free memory was 189.9MB in the beginning and 267.3MB in the end (delta: -77.4MB). Peak memory consumption was 192.1MB. Max. memory is 16.1GB. [2024-11-12 17:46:17,882 INFO L158 Benchmark]: Witness Printer took 162.31ms. Allocated memory is still 323.0MB. Free memory was 267.3MB in the beginning and 262.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 17:46:17,883 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.72ms. Allocated memory is still 146.8MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.68ms. Allocated memory is still 146.8MB. Free memory was 76.3MB in the beginning and 64.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.81ms. Allocated memory is still 146.8MB. Free memory was 64.1MB in the beginning and 62.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.61ms. Allocated memory is still 146.8MB. Free memory was 62.0MB in the beginning and 60.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 473.13ms. Allocated memory was 146.8MB in the beginning and 222.3MB in the end (delta: 75.5MB). Free memory was 60.5MB in the beginning and 189.9MB in the end (delta: -129.3MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11541.22ms. Allocated memory was 222.3MB in the beginning and 323.0MB in the end (delta: 100.7MB). Free memory was 189.9MB in the beginning and 267.3MB in the end (delta: -77.4MB). Peak memory consumption was 192.1MB. Max. memory is 16.1GB. * Witness Printer took 162.31ms. Allocated memory is still 323.0MB. Free memory was 267.3MB in the beginning and 262.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: 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: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: 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: 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: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: 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 2 procedures, 122 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 18, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1497 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1444 mSDsluCounter, 3668 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2325 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2644 IncrementalHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 1343 mSDtfsCounter, 2644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2027 GetRequests, 1894 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=17, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 331 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2189 NumberOfCodeBlocks, 2189 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2830 ConstructedInterpolants, 0 QuantifiedInterpolants, 14213 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1683 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 34 InterpolantComputations, 10 PerfectInterpolantSequences, 2894/4265 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 50 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((n <= 2) && (3 == t)) && (a == 1)) && (s == 4)) && (0 <= n)) || (((((n <= 2) && (t == 1)) && (a == 0)) && (0 <= n)) && (s == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-12 17:46:17,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE