./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.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/verifythis/elimination_max_rec_onepoint.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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:55:10,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:55:10,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:55:10,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:55:10,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:55:10,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:55:10,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:55:10,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:55:10,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:55:10,231 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:55:10,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:55:10,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:55:10,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:55:10,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:55:10,234 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:55:10,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:55:10,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:55:10,235 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:55:10,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:55:10,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:55:10,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:55:10,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:55:10,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:55:10,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:55:10,237 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:55:10,237 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:55:10,238 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:55:10,238 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:55:10,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:55:10,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:55:10,239 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:55:10,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:55:10,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:55:10,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:55:10,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:55:10,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:55:10,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:55:10,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:55:10,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:55:10,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:55:10,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:55:10,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:55:10,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:55:10,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:55:10,241 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2024-11-12 17:55:10,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:55:10,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:55:10,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:55:10,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:55:10,475 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:55:10,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-12 17:55:11,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:55:11,845 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:55:11,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-12 17:55:11,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea8c1d58e/bcabb39c188f4fafa78f995b4352d39a/FLAG24136462b [2024-11-12 17:55:12,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea8c1d58e/bcabb39c188f4fafa78f995b4352d39a [2024-11-12 17:55:12,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:55:12,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:55:12,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:55:12,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:55:12,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:55:12,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:55:12" (1/1) ... [2024-11-12 17:55:12,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a101936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:12, skipping insertion in model container [2024-11-12 17:55:12,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:55:12" (1/1) ... [2024-11-12 17:55:12,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:55:12,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:55:12,440 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:55:12,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:55:12,469 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:55:12,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:12 WrapperNode [2024-11-12 17:55:12,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:55:12,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:55:12,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:55:12,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:55:12,476 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:55:12" (1/1) ... [2024-11-12 17:55:12,485 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:55:12" (1/1) ... [2024-11-12 17:55:12,502 INFO L138 Inliner]: procedures = 19, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2024-11-12 17:55:12,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:55:12,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:55:12,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:55:12,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:55:12,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:12" (1/1) ... [2024-11-12 17:55:12,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:12" (1/1) ... [2024-11-12 17:55:12,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:12" (1/1) ... [2024-11-12 17:55:12,522 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-12 17:55:12,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:12" (1/1) ... [2024-11-12 17:55:12,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:12" (1/1) ... [2024-11-12 17:55:12,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:12" (1/1) ... [2024-11-12 17:55:12,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:12" (1/1) ... [2024-11-12 17:55:12,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:12" (1/1) ... [2024-11-12 17:55:12,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:12" (1/1) ... [2024-11-12 17:55:12,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:55:12,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:55:12,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:55:12,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:55:12,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:12" (1/1) ... [2024-11-12 17:55:12,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:55:12,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:12,566 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:55:12,568 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:55:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:55:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 17:55:12,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 17:55:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:55:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 17:55:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-12 17:55:12,606 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-12 17:55:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 17:55:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:55:12,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:55:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 17:55:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 17:55:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 17:55:12,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 17:55:12,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 17:55:12,679 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:55:12,682 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:55:12,827 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-12 17:55:12,827 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:55:12,839 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:55:12,839 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 17:55:12,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:55:12 BoogieIcfgContainer [2024-11-12 17:55:12,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:55:12,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:55:12,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:55:12,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:55:12,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:55:12" (1/3) ... [2024-11-12 17:55:12,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474241fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:55:12, skipping insertion in model container [2024-11-12 17:55:12,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:12" (2/3) ... [2024-11-12 17:55:12,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474241fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:55:12, skipping insertion in model container [2024-11-12 17:55:12,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:55:12" (3/3) ... [2024-11-12 17:55:12,848 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-11-12 17:55:12,860 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:55:12,861 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-12 17:55:12,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:55:12,911 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;@67d8bf07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:55:12,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 17:55:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 35 states have internal predecessors, (39), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 17:55:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 17:55:12,919 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:12,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:12,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:55:12,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash 734614260, now seen corresponding path program 1 times [2024-11-12 17:55:12,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:12,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911339035] [2024-11-12 17:55:12,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:12,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:13,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:55:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:55:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:13,078 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:55:13,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:13,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911339035] [2024-11-12 17:55:13,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911339035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:13,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:13,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:55:13,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558541346] [2024-11-12 17:55:13,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:13,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 17:55:13,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:13,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 17:55:13,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 17:55:13,104 INFO L87 Difference]: Start difference. First operand has 47 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 35 states have internal predecessors, (39), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:55:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:13,120 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2024-11-12 17:55:13,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 17:55:13,121 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-11-12 17:55:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:13,126 INFO L225 Difference]: With dead ends: 90 [2024-11-12 17:55:13,126 INFO L226 Difference]: Without dead ends: 35 [2024-11-12 17:55:13,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:55:13,130 INFO L435 NwaCegarLoop]: 52 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, 52 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:55:13,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:55:13,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-12 17:55:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-12 17:55:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:55:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-12 17:55:13,157 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 16 [2024-11-12 17:55:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:13,157 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-12 17:55:13,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:55:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-12 17:55:13,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 17:55:13,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:13,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:13,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:55:13,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:55:13,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1050038000, now seen corresponding path program 1 times [2024-11-12 17:55:13,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:13,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620244389] [2024-11-12 17:55:13,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:13,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:13,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:55:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:13,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:55:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 17:55:13,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:13,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620244389] [2024-11-12 17:55:13,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620244389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:13,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380753310] [2024-11-12 17:55:13,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:13,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:13,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:13,416 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:55:13,418 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:55:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:13,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 17:55:13,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 17:55:13,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:55:13,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380753310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:13,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:55:13,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2024-11-12 17:55:13,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308171352] [2024-11-12 17:55:13,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:13,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:55:13,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:13,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:55:13,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:55:13,595 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:55:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:13,645 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-12 17:55:13,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:55:13,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-11-12 17:55:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:13,647 INFO L225 Difference]: With dead ends: 35 [2024-11-12 17:55:13,647 INFO L226 Difference]: Without dead ends: 33 [2024-11-12 17:55:13,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:55:13,648 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:13,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 131 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:55:13,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-12 17:55:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-12 17:55:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:55:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-12 17:55:13,654 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 16 [2024-11-12 17:55:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:13,656 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-12 17:55:13,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:55:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-12 17:55:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 17:55:13,657 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:13,658 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] [2024-11-12 17:55:13,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 17:55:13,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:13,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:55:13,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:13,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1984831185, now seen corresponding path program 1 times [2024-11-12 17:55:13,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:13,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89355841] [2024-11-12 17:55:13,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:13,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:13,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:55:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:13,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:55:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:55:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:13,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 17:55:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:13,976 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:55:13,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89355841] [2024-11-12 17:55:13,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89355841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:13,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:13,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:55:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269742729] [2024-11-12 17:55:13,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:13,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:55:13,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:13,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:55:13,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:55:13,978 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 17:55:14,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:14,022 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-12 17:55:14,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:55:14,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-12 17:55:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:14,023 INFO L225 Difference]: With dead ends: 49 [2024-11-12 17:55:14,023 INFO L226 Difference]: Without dead ends: 47 [2024-11-12 17:55:14,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:55:14,024 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:14,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 120 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:55:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-12 17:55:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-12 17:55:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 17:55:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-11-12 17:55:14,030 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 33 [2024-11-12 17:55:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:14,030 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-12 17:55:14,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 17:55:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-11-12 17:55:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 17:55:14,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:14,031 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] [2024-11-12 17:55:14,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 17:55:14,032 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:55:14,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:14,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1984830993, now seen corresponding path program 1 times [2024-11-12 17:55:14,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:14,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598768696] [2024-11-12 17:55:14,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:14,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:55:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:55:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:55:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 17:55:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,149 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:55:14,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:14,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598768696] [2024-11-12 17:55:14,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598768696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:14,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:14,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 17:55:14,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633238275] [2024-11-12 17:55:14,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:14,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 17:55:14,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:14,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 17:55:14,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:55:14,153 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 17:55:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:14,223 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-12 17:55:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:55:14,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-12 17:55:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:14,225 INFO L225 Difference]: With dead ends: 47 [2024-11-12 17:55:14,225 INFO L226 Difference]: Without dead ends: 46 [2024-11-12 17:55:14,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:55:14,228 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 20 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:14,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 146 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:55:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-12 17:55:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-11-12 17:55:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 17:55:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-12 17:55:14,236 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2024-11-12 17:55:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:14,236 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-12 17:55:14,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 17:55:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-12 17:55:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 17:55:14,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:14,237 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] [2024-11-12 17:55:14,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 17:55:14,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:55:14,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:14,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1400218561, now seen corresponding path program 1 times [2024-11-12 17:55:14,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:14,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114933310] [2024-11-12 17:55:14,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:14,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:55:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:55:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:55:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 17:55:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,325 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:55:14,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:14,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114933310] [2024-11-12 17:55:14,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114933310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:14,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:14,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:55:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043308105] [2024-11-12 17:55:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:14,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:55:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:55:14,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:55:14,327 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 17:55:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:14,373 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-12 17:55:14,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:55:14,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-12 17:55:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:14,377 INFO L225 Difference]: With dead ends: 44 [2024-11-12 17:55:14,377 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 17:55:14,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:55:14,378 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:14,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 101 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:55:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 17:55:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-12 17:55:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 17:55:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-11-12 17:55:14,382 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 34 [2024-11-12 17:55:14,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:14,383 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-12 17:55:14,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 17:55:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-11-12 17:55:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 17:55:14,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:14,384 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-11-12 17:55:14,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 17:55:14,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:55:14,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:14,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1958074394, now seen corresponding path program 1 times [2024-11-12 17:55:14,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:14,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991862102] [2024-11-12 17:55:14,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:14,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:55:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:55:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:55:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 17:55:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:55:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-12 17:55:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-12 17:55:14,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:14,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991862102] [2024-11-12 17:55:14,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991862102] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:14,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379710248] [2024-11-12 17:55:14,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:14,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:14,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:14,550 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:55:14,551 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:55:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:14,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 17:55:14,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-12 17:55:14,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:55:14,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379710248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:14,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:55:14,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-11-12 17:55:14,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438923971] [2024-11-12 17:55:14,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:14,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 17:55:14,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:14,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 17:55:14,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:55:14,695 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 17:55:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:14,772 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-11-12 17:55:14,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 17:55:14,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2024-11-12 17:55:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:14,774 INFO L225 Difference]: With dead ends: 44 [2024-11-12 17:55:14,774 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 17:55:14,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-12 17:55:14,775 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:14,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 193 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:55:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 17:55:14,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-12 17:55:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 17:55:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-12 17:55:14,781 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 50 [2024-11-12 17:55:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:14,781 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-12 17:55:14,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 17:55:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-12 17:55:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 17:55:14,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:14,782 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-11-12 17:55:14,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 17:55:14,983 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,SelfDestructingSolverStorable5 [2024-11-12 17:55:14,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:55:14,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:14,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1958074202, now seen corresponding path program 1 times [2024-11-12 17:55:14,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:14,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84651168] [2024-11-12 17:55:14,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:55:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:55:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:55:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 17:55:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:55:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-12 17:55:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,098 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-12 17:55:15,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:15,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84651168] [2024-11-12 17:55:15,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84651168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:15,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111199051] [2024-11-12 17:55:15,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:15,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:15,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:15,101 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:55:15,104 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:55:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 17:55:15,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-12 17:55:15,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:55:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-12 17:55:15,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111199051] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:55:15,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:55:15,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2024-11-12 17:55:15,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84892229] [2024-11-12 17:55:15,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:55:15,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 17:55:15,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:15,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 17:55:15,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-12 17:55:15,381 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 16 states have internal predecessors, (46), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-12 17:55:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:15,599 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-11-12 17:55:15,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 17:55:15,600 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 16 states have internal predecessors, (46), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 50 [2024-11-12 17:55:15,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:15,601 INFO L225 Difference]: With dead ends: 44 [2024-11-12 17:55:15,601 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 17:55:15,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 17:55:15,602 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 78 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:15,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 261 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:55:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 17:55:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-11-12 17:55:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 17:55:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-12 17:55:15,607 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 50 [2024-11-12 17:55:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:15,607 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-12 17:55:15,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 16 states have internal predecessors, (46), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-12 17:55:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-12 17:55:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 17:55:15,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:15,608 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] [2024-11-12 17:55:15,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 17:55:15,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:15,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:55:15,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:15,809 INFO L85 PathProgramCache]: Analyzing trace with hash -570763998, now seen corresponding path program 1 times [2024-11-12 17:55:15,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:15,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935447388] [2024-11-12 17:55:15,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:15,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:55:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:55:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:55:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 17:55:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:55:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-12 17:55:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-12 17:55:15,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:15,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935447388] [2024-11-12 17:55:15,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935447388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:15,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203056216] [2024-11-12 17:55:15,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:15,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:15,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:15,897 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:55:15,898 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:55:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:15,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 17:55:15,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-12 17:55:16,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:55:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-12 17:55:16,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203056216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:55:16,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:55:16,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-12 17:55:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113733623] [2024-11-12 17:55:16,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:55:16,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 17:55:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:16,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 17:55:16,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-12 17:55:16,085 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 12 states have internal predecessors, (43), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 17:55:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:16,249 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2024-11-12 17:55:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 17:55:16,250 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 12 states have internal predecessors, (43), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 51 [2024-11-12 17:55:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:16,250 INFO L225 Difference]: With dead ends: 79 [2024-11-12 17:55:16,251 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 17:55:16,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2024-11-12 17:55:16,252 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 75 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:16,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 240 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:55:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 17:55:16,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-12 17:55:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 54 states have internal predecessors, (59), 18 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 17:55:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2024-11-12 17:55:16,259 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 51 [2024-11-12 17:55:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:16,259 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2024-11-12 17:55:16,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 12 states have internal predecessors, (43), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 17:55:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2024-11-12 17:55:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 17:55:16,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:16,260 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:16,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 17:55:16,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:16,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:55:16,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:16,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1714613049, now seen corresponding path program 2 times [2024-11-12 17:55:16,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:16,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773111882] [2024-11-12 17:55:16,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:16,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:55:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:55:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:55:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 17:55:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:55:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-12 17:55:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:55:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 17:55:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:55:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 17:55:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 17:55:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 17:55:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-12 17:55:16,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:16,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773111882] [2024-11-12 17:55:16,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773111882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:16,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356158952] [2024-11-12 17:55:16,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:55:16,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:16,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:16,777 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:55:16,778 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:55:16,859 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 17:55:16,859 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:55:16,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 17:55:16,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-12 17:55:16,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:55:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-12 17:55:17,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356158952] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:55:17,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:55:17,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2024-11-12 17:55:17,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202409159] [2024-11-12 17:55:17,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:55:17,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-12 17:55:17,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:17,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-12 17:55:17,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 17:55:17,190 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 24 states have internal predecessors, (79), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-12 17:55:17,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:17,705 INFO L93 Difference]: Finished difference Result 151 states and 189 transitions. [2024-11-12 17:55:17,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-12 17:55:17,705 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 24 states have internal predecessors, (79), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 102 [2024-11-12 17:55:17,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:17,707 INFO L225 Difference]: With dead ends: 151 [2024-11-12 17:55:17,708 INFO L226 Difference]: Without dead ends: 150 [2024-11-12 17:55:17,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=830, Invalid=3202, Unknown=0, NotChecked=0, Total=4032 [2024-11-12 17:55:17,710 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 204 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:17,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 385 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:55:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-12 17:55:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 140. [2024-11-12 17:55:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 101 states have (on average 1.118811881188119) internal successors, (113), 102 states have internal predecessors, (113), 36 states have call successors, (36), 13 states have call predecessors, (36), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 17:55:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2024-11-12 17:55:17,726 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 173 transitions. Word has length 102 [2024-11-12 17:55:17,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:17,726 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 173 transitions. [2024-11-12 17:55:17,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 24 states have internal predecessors, (79), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-12 17:55:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2024-11-12 17:55:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-12 17:55:17,728 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:17,728 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:17,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 17:55:17,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:17,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 17:55:17,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash 414222489, now seen corresponding path program 3 times [2024-11-12 17:55:17,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:17,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372860257] [2024-11-12 17:55:17,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:17,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:55:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:55:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:55:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 17:55:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 17:55:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-12 17:55:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:55:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 17:55:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:55:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 17:55:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 17:55:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 17:55:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 17:55:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 17:55:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 17:55:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 17:55:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 17:55:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 17:55:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 17:55:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 17:55:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-12 17:55:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 17:55:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 17:55:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-12 17:55:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2024-11-12 17:55:18,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:18,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372860257] [2024-11-12 17:55:18,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372860257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:18,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327922343] [2024-11-12 17:55:18,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 17:55:18,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:18,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:18,947 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:55:18,948 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:55:19,094 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2024-11-12 17:55:19,094 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:55:19,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 17:55:19,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2024-11-12 17:55:19,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:55:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2024-11-12 17:55:19,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327922343] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:55:19,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:55:19,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 6, 6] total 44 [2024-11-12 17:55:19,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387379982] [2024-11-12 17:55:19,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:55:19,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-12 17:55:19,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:19,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-12 17:55:19,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2024-11-12 17:55:19,581 INFO L87 Difference]: Start difference. First operand 140 states and 173 transitions. Second operand has 45 states, 44 states have (on average 2.5681818181818183) internal successors, (113), 32 states have internal predecessors, (113), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-12 17:55:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:22,398 INFO L93 Difference]: Finished difference Result 307 states and 382 transitions. [2024-11-12 17:55:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2024-11-12 17:55:22,398 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.5681818181818183) internal successors, (113), 32 states have internal predecessors, (113), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 204 [2024-11-12 17:55:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:22,399 INFO L225 Difference]: With dead ends: 307 [2024-11-12 17:55:22,400 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 17:55:22,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9950 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5785, Invalid=25015, Unknown=0, NotChecked=0, Total=30800 [2024-11-12 17:55:22,408 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 978 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:22,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 322 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 17:55:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 17:55:22,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 17:55:22,409 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:55:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 17:55:22,409 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2024-11-12 17:55:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:22,409 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 17:55:22,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.5681818181818183) internal successors, (113), 32 states have internal predecessors, (113), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2024-11-12 17:55:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 17:55:22,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 17:55:22,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-12 17:55:22,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-12 17:55:22,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-12 17:55:22,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-12 17:55:22,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-12 17:55:22,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-12 17:55:22,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 17:55:22,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:22,619 INFO L421 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:22,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 17:55:25,207 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:55:25,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:55:25 BoogieIcfgContainer [2024-11-12 17:55:25,221 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:55:25,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:55:25,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:55:25,222 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:55:25,222 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:55:12" (3/4) ... [2024-11-12 17:55:25,224 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 17:55:25,226 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 17:55:25,227 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2024-11-12 17:55:25,227 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-12 17:55:25,230 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-12 17:55:25,230 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 17:55:25,230 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 17:55:25,230 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 17:55:25,295 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:55:25,296 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 17:55:25,296 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:55:25,296 INFO L158 Benchmark]: Toolchain (without parser) took 13041.86ms. Allocated memory was 161.5MB in the beginning and 377.5MB in the end (delta: 216.0MB). Free memory was 119.3MB in the beginning and 239.3MB in the end (delta: -120.1MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. [2024-11-12 17:55:25,296 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 161.5MB. Free memory was 123.7MB in the beginning and 123.5MB in the end (delta: 226.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:55:25,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.01ms. Allocated memory is still 161.5MB. Free memory was 119.3MB in the beginning and 105.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 17:55:25,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.37ms. Allocated memory is still 161.5MB. Free memory was 105.7MB in the beginning and 103.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:55:25,297 INFO L158 Benchmark]: Boogie Preprocessor took 35.45ms. Allocated memory is still 161.5MB. Free memory was 103.9MB in the beginning and 102.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:55:25,298 INFO L158 Benchmark]: RCFGBuilder took 301.37ms. Allocated memory is still 161.5MB. Free memory was 102.0MB in the beginning and 87.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 17:55:25,298 INFO L158 Benchmark]: TraceAbstraction took 12377.56ms. Allocated memory was 161.5MB in the beginning and 377.5MB in the end (delta: 216.0MB). Free memory was 86.3MB in the beginning and 244.6MB in the end (delta: -158.3MB). Peak memory consumption was 182.1MB. Max. memory is 16.1GB. [2024-11-12 17:55:25,298 INFO L158 Benchmark]: Witness Printer took 74.13ms. Allocated memory is still 377.5MB. Free memory was 244.6MB in the beginning and 239.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 17:55:25,300 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 161.5MB. Free memory was 123.7MB in the beginning and 123.5MB in the end (delta: 226.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.01ms. Allocated memory is still 161.5MB. Free memory was 119.3MB in the beginning and 105.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.37ms. Allocated memory is still 161.5MB. Free memory was 105.7MB in the beginning and 103.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.45ms. Allocated memory is still 161.5MB. Free memory was 103.9MB in the beginning and 102.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 301.37ms. Allocated memory is still 161.5MB. Free memory was 102.0MB in the beginning and 87.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12377.56ms. Allocated memory was 161.5MB in the beginning and 377.5MB in the end (delta: 216.0MB). Free memory was 86.3MB in the beginning and 244.6MB in the end (delta: -158.3MB). Peak memory consumption was 182.1MB. Max. memory is 16.1GB. * Witness Printer took 74.13ms. Allocated memory is still 377.5MB. Free memory was 244.6MB in the beginning and 239.3MB 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: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: 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 4 procedures, 47 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 10, TraceHistogramMax: 13, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1424 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1423 mSDsluCounter, 1951 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1642 mSDsCounter, 292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1058 IncrementalHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 292 mSolverCounterUnsat, 309 mSDtfsCounter, 1058 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1317 GetRequests, 983 SyntacticMatches, 0 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=9, InterpolantAutomatonStates: 244, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1062 NumberOfCodeBlocks, 1062 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1449 ConstructedInterpolants, 0 QuantifiedInterpolants, 2763 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1745 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 3098/4009 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 16]: Procedure Contract for check Derived contract for procedure check. Requires: ((((1 <= y) && (1 <= x)) && (y <= 2147483646)) || ((y <= 2147483646) && (x == 0))) Ensures: ((((1 <= y) && (1 <= x)) && (y <= 2147483646)) || ((y <= 2147483646) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-12 17:55:25,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE