./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/pnr4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc 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/array-tiling/pnr4.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 c2f943c7ce97bf9be3e11b9d2df150d740ebe8f456342884d8ad0d40610fb008 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:01:03,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:01:03,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:01:03,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:01:03,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:01:03,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:01:03,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:01:03,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:01:03,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:01:03,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:01:03,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:01:03,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:01:03,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:01:03,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:01:03,138 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:01:03,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:01:03,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:01:03,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:01:03,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:01:03,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:01:03,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:01:03,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:01:03,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:01:03,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:01:03,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:01:03,144 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:01:03,144 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:01:03,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:01:03,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:01:03,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:01:03,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:01:03,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:01:03,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:01:03,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:01:03,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:01:03,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:01:03,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:01:03,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:01:03,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:01:03,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:01:03,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:01:03,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:01:03,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:01:03,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:01:03,149 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 -> c2f943c7ce97bf9be3e11b9d2df150d740ebe8f456342884d8ad0d40610fb008 [2024-11-19 10:01:03,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:01:03,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:01:03,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:01:03,479 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:01:03,480 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:01:03,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr4.c [2024-11-19 10:01:04,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:01:05,058 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:01:05,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr4.c [2024-11-19 10:01:05,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769eb329b/db793f69d6e444e8bfa71ac51b83110b/FLAG1927c8205 [2024-11-19 10:01:05,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769eb329b/db793f69d6e444e8bfa71ac51b83110b [2024-11-19 10:01:05,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:01:05,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:01:05,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:01:05,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:01:05,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:01:05,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c56f278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05, skipping insertion in model container [2024-11-19 10:01:05,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:01:05,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:01:05,684 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:01:05,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:01:05,735 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:01:05,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05 WrapperNode [2024-11-19 10:01:05,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:01:05,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:01:05,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:01:05,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:01:05,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,773 INFO L138 Inliner]: procedures = 17, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2024-11-19 10:01:05,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:01:05,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:01:05,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:01:05,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:01:05,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,804 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 7, 9]. 50 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 8 writes are split as follows [0, 0, 8]. [2024-11-19 10:01:05,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:01:05,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:01:05,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:01:05,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:01:05,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05" (1/1) ... [2024-11-19 10:01:05,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:01:05,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:01:05,864 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-19 10:01:05,867 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-19 10:01:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:01:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:01:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 10:01:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 10:01:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 10:01:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 10:01:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 10:01:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 10:01:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2024-11-19 10:01:05,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2024-11-19 10:01:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:01:05,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:01:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 10:01:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 10:01:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 10:01:06,008 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:01:06,010 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:01:06,430 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-11-19 10:01:06,430 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:01:06,454 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:01:06,457 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 10:01:06,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:01:06 BoogieIcfgContainer [2024-11-19 10:01:06,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:01:06,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:01:06,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:01:06,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:01:06,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:01:05" (1/3) ... [2024-11-19 10:01:06,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5dbb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:01:06, skipping insertion in model container [2024-11-19 10:01:06,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:01:05" (2/3) ... [2024-11-19 10:01:06,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5dbb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:01:06, skipping insertion in model container [2024-11-19 10:01:06,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:01:06" (3/3) ... [2024-11-19 10:01:06,467 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr4.c [2024-11-19 10:01:06,481 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:01:06,482 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2024-11-19 10:01:06,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:01:06,544 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;@3360d938, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:01:06,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2024-11-19 10:01:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 67 states have (on average 1.7462686567164178) internal successors, (117), 105 states have internal predecessors, (117), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:01:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 10:01:06,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:01:06,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:01:06,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-19 10:01:06,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:01:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash -655793907, now seen corresponding path program 1 times [2024-11-19 10:01:06,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:01:06,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625646191] [2024-11-19 10:01:06,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:06,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:01:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:01:06,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:01:06,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625646191] [2024-11-19 10:01:06,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625646191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:01:06,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:01:06,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:01:06,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486756030] [2024-11-19 10:01:06,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:01:06,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:01:06,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:01:07,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:01:07,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:01:07,011 INFO L87 Difference]: Start difference. First operand has 111 states, 67 states have (on average 1.7462686567164178) internal successors, (117), 105 states have internal predecessors, (117), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-19 10:01:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:01:07,103 INFO L93 Difference]: Finished difference Result 222 states and 246 transitions. [2024-11-19 10:01:07,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:01:07,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 10:01:07,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:01:07,113 INFO L225 Difference]: With dead ends: 222 [2024-11-19 10:01:07,114 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 10:01:07,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:01:07,121 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 215 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:01:07,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 118 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:01:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 10:01:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-19 10:01:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 97 states have internal predecessors, (103), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:01:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2024-11-19 10:01:07,162 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 7 [2024-11-19 10:01:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:01:07,163 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2024-11-19 10:01:07,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-19 10:01:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2024-11-19 10:01:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:01:07,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:01:07,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:01:07,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:01:07,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-19 10:01:07,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:01:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1145225419, now seen corresponding path program 1 times [2024-11-19 10:01:07,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:01:07,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723737889] [2024-11-19 10:01:07,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:07,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:01:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:01:07,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:01:07,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723737889] [2024-11-19 10:01:07,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723737889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:01:07,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:01:07,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:01:07,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873729968] [2024-11-19 10:01:07,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:01:07,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:01:07,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:01:07,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:01:07,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:01:07,389 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-19 10:01:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:01:07,499 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2024-11-19 10:01:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:01:07,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 10:01:07,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:01:07,502 INFO L225 Difference]: With dead ends: 103 [2024-11-19 10:01:07,502 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 10:01:07,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:01:07,504 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 196 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:01:07,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 103 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:01:07,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 10:01:07,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-19 10:01:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 96 states have internal predecessors, (102), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:01:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2024-11-19 10:01:07,521 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 8 [2024-11-19 10:01:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:01:07,521 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2024-11-19 10:01:07,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-19 10:01:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2024-11-19 10:01:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:01:07,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:01:07,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:01:07,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:01:07,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-19 10:01:07,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:01:07,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1693576028, now seen corresponding path program 1 times [2024-11-19 10:01:07,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:01:07,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281232325] [2024-11-19 10:01:07,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:07,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:01:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:01:07,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:01:07,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281232325] [2024-11-19 10:01:07,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281232325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:01:07,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:01:07,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:01:07,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458657365] [2024-11-19 10:01:07,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:01:07,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:01:07,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:01:07,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:01:07,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:01:07,637 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-19 10:01:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:01:07,764 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2024-11-19 10:01:07,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:01:07,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 10:01:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:01:07,766 INFO L225 Difference]: With dead ends: 110 [2024-11-19 10:01:07,766 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 10:01:07,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:01:07,767 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:01:07,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 243 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:01:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 10:01:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-19 10:01:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 102 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:01:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2024-11-19 10:01:07,788 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 15 [2024-11-19 10:01:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:01:07,789 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2024-11-19 10:01:07,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-19 10:01:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2024-11-19 10:01:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:01:07,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:01:07,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:01:07,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:01:07,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-19 10:01:07,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:01:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1337762001, now seen corresponding path program 1 times [2024-11-19 10:01:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:01:07,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82819522] [2024-11-19 10:01:07,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:07,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:01:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:01:07,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:01:07,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82819522] [2024-11-19 10:01:07,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82819522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:01:07,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:01:07,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:01:07,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693702407] [2024-11-19 10:01:07,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:01:07,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:01:07,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:01:07,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:01:07,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:01:07,860 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:01:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:01:08,099 INFO L93 Difference]: Finished difference Result 188 states and 205 transitions. [2024-11-19 10:01:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:01:08,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 10:01:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:01:08,101 INFO L225 Difference]: With dead ends: 188 [2024-11-19 10:01:08,101 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 10:01:08,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:01:08,103 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 42 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:01:08,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 110 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:01:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 10:01:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2024-11-19 10:01:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 110 states have (on average 1.4181818181818182) internal successors, (156), 145 states have internal predecessors, (156), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:01:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2024-11-19 10:01:08,126 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 16 [2024-11-19 10:01:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:01:08,129 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2024-11-19 10:01:08,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:01:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2024-11-19 10:01:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 10:01:08,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:01:08,130 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:01:08,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:01:08,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-19 10:01:08,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:01:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash -685077393, now seen corresponding path program 1 times [2024-11-19 10:01:08,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:01:08,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851005534] [2024-11-19 10:01:08,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:08,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:01:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 10:01:08,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:01:08,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851005534] [2024-11-19 10:01:08,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851005534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:01:08,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:01:08,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:01:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942410083] [2024-11-19 10:01:08,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:01:08,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:01:08,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:01:08,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:01:08,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:01:08,365 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-19 10:01:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:01:08,573 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2024-11-19 10:01:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:01:08,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-19 10:01:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:01:08,576 INFO L225 Difference]: With dead ends: 171 [2024-11-19 10:01:08,576 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 10:01:08,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:01:08,578 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 292 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:01:08,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 90 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:01:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 10:01:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2024-11-19 10:01:08,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 145 states have internal predecessors, (155), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:01:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2024-11-19 10:01:08,592 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 21 [2024-11-19 10:01:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:01:08,592 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2024-11-19 10:01:08,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-19 10:01:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2024-11-19 10:01:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 10:01:08,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:01:08,594 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:01:08,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:01:08,595 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-19 10:01:08,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:01:08,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1015019068, now seen corresponding path program 1 times [2024-11-19 10:01:08,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:01:08,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311472401] [2024-11-19 10:01:08,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:08,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:01:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 10:01:08,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:01:08,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311472401] [2024-11-19 10:01:08,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311472401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:01:08,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:01:08,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:01:08,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787944781] [2024-11-19 10:01:08,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:01:08,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:01:08,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:01:08,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:01:08,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:01:08,670 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 10:01:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:01:08,811 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2024-11-19 10:01:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:01:08,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2024-11-19 10:01:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:01:08,813 INFO L225 Difference]: With dead ends: 160 [2024-11-19 10:01:08,813 INFO L226 Difference]: Without dead ends: 158 [2024-11-19 10:01:08,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:01:08,814 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 21 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:01:08,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 179 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:01:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-19 10:01:08,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-19 10:01:08,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.3982300884955752) internal successors, (158), 148 states have internal predecessors, (158), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:01:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2024-11-19 10:01:08,828 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 51 [2024-11-19 10:01:08,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:01:08,829 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2024-11-19 10:01:08,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 10:01:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2024-11-19 10:01:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 10:01:08,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:01:08,831 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:01:08,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:01:08,831 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-19 10:01:08,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:01:08,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1191104516, now seen corresponding path program 1 times [2024-11-19 10:01:08,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:01:08,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012324136] [2024-11-19 10:01:08,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:08,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:01:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 10:01:08,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:01:08,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012324136] [2024-11-19 10:01:08,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012324136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:01:08,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953625390] [2024-11-19 10:01:08,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:08,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:01:08,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:01:08,950 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-19 10:01:08,952 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-19 10:01:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:09,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:01:09,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:01:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 10:01:09,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:01:09,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953625390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:01:09,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:01:09,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-19 10:01:09,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934475231] [2024-11-19 10:01:09,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:01:09,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:01:09,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:01:09,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:01:09,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:01:09,189 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 10:01:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:01:09,400 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2024-11-19 10:01:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:01:09,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-11-19 10:01:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:01:09,401 INFO L225 Difference]: With dead ends: 158 [2024-11-19 10:01:09,401 INFO L226 Difference]: Without dead ends: 141 [2024-11-19 10:01:09,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:01:09,403 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 62 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:01:09,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 171 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:01:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-19 10:01:09,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-19 10:01:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 113 states have (on average 1.247787610619469) internal successors, (141), 131 states have internal predecessors, (141), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:01:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 157 transitions. [2024-11-19 10:01:09,419 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 157 transitions. Word has length 62 [2024-11-19 10:01:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:01:09,420 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 157 transitions. [2024-11-19 10:01:09,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 10:01:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 157 transitions. [2024-11-19 10:01:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 10:01:09,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:01:09,422 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:01:09,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:01:09,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:01:09,629 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-19 10:01:09,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:01:09,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1730465598, now seen corresponding path program 1 times [2024-11-19 10:01:09,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:01:09,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418915929] [2024-11-19 10:01:09,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:09,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:01:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 10:01:09,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:01:09,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418915929] [2024-11-19 10:01:09,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418915929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:01:09,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171379725] [2024-11-19 10:01:09,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:09,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:01:09,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:01:09,720 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-19 10:01:09,722 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-19 10:01:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:09,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:01:09,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:01:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 10:01:09,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:01:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 10:01:09,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171379725] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:01:09,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:01:09,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-19 10:01:09,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217743926] [2024-11-19 10:01:09,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:01:09,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:01:09,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:01:09,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:01:09,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:01:09,995 INFO L87 Difference]: Start difference. First operand 141 states and 157 transitions. Second operand has 10 states, 9 states have (on average 12.666666666666666) internal successors, (114), 10 states have internal predecessors, (114), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-19 10:01:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:01:10,247 INFO L93 Difference]: Finished difference Result 204 states and 248 transitions. [2024-11-19 10:01:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:01:10,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.666666666666666) internal successors, (114), 10 states have internal predecessors, (114), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 63 [2024-11-19 10:01:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:01:10,249 INFO L225 Difference]: With dead ends: 204 [2024-11-19 10:01:10,249 INFO L226 Difference]: Without dead ends: 187 [2024-11-19 10:01:10,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:01:10,251 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 151 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:01:10,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 196 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:01:10,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-19 10:01:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-19 10:01:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 168 states have (on average 1.125) internal successors, (189), 172 states have internal predecessors, (189), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 10:01:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 215 transitions. [2024-11-19 10:01:10,262 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 215 transitions. Word has length 63 [2024-11-19 10:01:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:01:10,263 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 215 transitions. [2024-11-19 10:01:10,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.666666666666666) internal successors, (114), 10 states have internal predecessors, (114), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-19 10:01:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 215 transitions. [2024-11-19 10:01:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 10:01:10,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:01:10,265 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:01:10,282 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-19 10:01:10,466 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,SelfDestructingSolverStorable7 [2024-11-19 10:01:10,466 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-19 10:01:10,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:01:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash -947038022, now seen corresponding path program 1 times [2024-11-19 10:01:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:01:10,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130923949] [2024-11-19 10:01:10,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:01:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 10:01:10,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:01:10,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130923949] [2024-11-19 10:01:10,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130923949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:01:10,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927176272] [2024-11-19 10:01:10,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:10,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:01:10,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:01:10,588 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-19 10:01:10,589 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-19 10:01:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:10,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:01:10,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:01:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 10:01:10,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:01:10,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927176272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:01:10,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:01:10,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-19 10:01:10,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070726064] [2024-11-19 10:01:10,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:01:10,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:01:10,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:01:10,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:01:10,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:01:10,708 INFO L87 Difference]: Start difference. First operand 187 states and 215 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 10:01:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:01:10,838 INFO L93 Difference]: Finished difference Result 187 states and 215 transitions. [2024-11-19 10:01:10,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:01:10,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 67 [2024-11-19 10:01:10,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:01:10,840 INFO L225 Difference]: With dead ends: 187 [2024-11-19 10:01:10,840 INFO L226 Difference]: Without dead ends: 186 [2024-11-19 10:01:10,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 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-19 10:01:10,841 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 95 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:01:10,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 112 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:01:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-19 10:01:10,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-19 10:01:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 168 states have (on average 1.119047619047619) internal successors, (188), 171 states have internal predecessors, (188), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 10:01:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 214 transitions. [2024-11-19 10:01:10,853 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 214 transitions. Word has length 67 [2024-11-19 10:01:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:01:10,855 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 214 transitions. [2024-11-19 10:01:10,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 10:01:10,855 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 214 transitions. [2024-11-19 10:01:10,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 10:01:10,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:01:10,860 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:01:10,877 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-19 10:01:11,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:01:11,061 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-19 10:01:11,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:01:11,061 INFO L85 PathProgramCache]: Analyzing trace with hash 706592581, now seen corresponding path program 1 times [2024-11-19 10:01:11,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:01:11,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190658523] [2024-11-19 10:01:11,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:11,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:01:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 10:01:11,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:01:11,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190658523] [2024-11-19 10:01:11,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190658523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:01:11,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579856343] [2024-11-19 10:01:11,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:11,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:01:11,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:01:11,183 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-19 10:01:11,185 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-19 10:01:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:11,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:01:11,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:01:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 10:01:11,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:01:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 10:01:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579856343] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:01:11,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:01:11,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-19 10:01:11,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926408367] [2024-11-19 10:01:11,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:01:11,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 10:01:11,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:01:11,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 10:01:11,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:01:11,367 INFO L87 Difference]: Start difference. First operand 186 states and 214 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 10:01:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:01:11,538 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2024-11-19 10:01:11,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:01:11,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2024-11-19 10:01:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:01:11,540 INFO L225 Difference]: With dead ends: 205 [2024-11-19 10:01:11,540 INFO L226 Difference]: Without dead ends: 204 [2024-11-19 10:01:11,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:01:11,541 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 131 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:01:11,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 183 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:01:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-19 10:01:11,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-19 10:01:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 186 states have (on average 1.10752688172043) internal successors, (206), 189 states have internal predecessors, (206), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 10:01:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2024-11-19 10:01:11,554 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 68 [2024-11-19 10:01:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:01:11,554 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2024-11-19 10:01:11,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 10:01:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2024-11-19 10:01:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 10:01:11,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:01:11,559 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:01:11,579 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-19 10:01:11,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:01:11,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-19 10:01:11,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:01:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash -954157716, now seen corresponding path program 2 times [2024-11-19 10:01:11,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:01:11,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611136810] [2024-11-19 10:01:11,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:01:11,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:01:11,775 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:01:11,776 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:01:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-19 10:01:11,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:01:11,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611136810] [2024-11-19 10:01:11,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611136810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:01:11,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694393185] [2024-11-19 10:01:11,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:01:11,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:01:11,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:01:11,818 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-19 10:01:11,820 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-19 10:01:11,888 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:01:11,888 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:01:11,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:01:11,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:01:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-19 10:01:12,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:01:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-19 10:01:12,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694393185] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:01:12,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:01:12,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-19 10:01:12,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875459115] [2024-11-19 10:01:12,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:01:12,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 10:01:12,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:01:12,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 10:01:12,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:01:12,153 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 9 states, 8 states have (on average 13.0) internal successors, (104), 9 states have internal predecessors, (104), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 10:01:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:01:12,311 INFO L93 Difference]: Finished difference Result 204 states and 232 transitions. [2024-11-19 10:01:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:01:12,312 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 13.0) internal successors, (104), 9 states have internal predecessors, (104), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 86 [2024-11-19 10:01:12,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:01:12,313 INFO L225 Difference]: With dead ends: 204 [2024-11-19 10:01:12,313 INFO L226 Difference]: Without dead ends: 170 [2024-11-19 10:01:12,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:01:12,314 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 160 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:01:12,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 75 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:01:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-19 10:01:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 160. [2024-11-19 10:01:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 146 states have (on average 1.0890410958904109) internal successors, (159), 146 states have internal predecessors, (159), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 10:01:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2024-11-19 10:01:12,325 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 86 [2024-11-19 10:01:12,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:01:12,325 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2024-11-19 10:01:12,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 13.0) internal successors, (104), 9 states have internal predecessors, (104), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 10:01:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2024-11-19 10:01:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-19 10:01:12,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:01:12,329 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:01:12,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 10:01:12,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 10:01:12,530 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2024-11-19 10:01:12,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:01:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash 942880584, now seen corresponding path program 1 times [2024-11-19 10:01:12,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:01:12,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455942989] [2024-11-19 10:01:12,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:01:12,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:01:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:01:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-19 10:01:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:01:12,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455942989] [2024-11-19 10:01:12,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455942989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:01:12,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:01:12,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:01:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536854935] [2024-11-19 10:01:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:01:12,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:01:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:01:12,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:01:12,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:01:12,630 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 10:01:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:01:12,697 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2024-11-19 10:01:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:01:12,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 144 [2024-11-19 10:01:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:01:12,698 INFO L225 Difference]: With dead ends: 160 [2024-11-19 10:01:12,699 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:01:12,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:01:12,700 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:01:12,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 74 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:01:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:01:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:01:12,701 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-19 10:01:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:01:12,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 144 [2024-11-19 10:01:12,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:01:12,701 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:01:12,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 10:01:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:01:12,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:01:12,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2024-11-19 10:01:12,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2024-11-19 10:01:12,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2024-11-19 10:01:12,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2024-11-19 10:01:12,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2024-11-19 10:01:12,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2024-11-19 10:01:12,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2024-11-19 10:01:12,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2024-11-19 10:01:12,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2024-11-19 10:01:12,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2024-11-19 10:01:12,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2024-11-19 10:01:12,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2024-11-19 10:01:12,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2024-11-19 10:01:12,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2024-11-19 10:01:12,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2024-11-19 10:01:12,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2024-11-19 10:01:12,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2024-11-19 10:01:12,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2024-11-19 10:01:12,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2024-11-19 10:01:12,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2024-11-19 10:01:12,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2024-11-19 10:01:12,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2024-11-19 10:01:12,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2024-11-19 10:01:12,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2024-11-19 10:01:12,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2024-11-19 10:01:12,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2024-11-19 10:01:12,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2024-11-19 10:01:12,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2024-11-19 10:01:12,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2024-11-19 10:01:12,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2024-11-19 10:01:12,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2024-11-19 10:01:12,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2024-11-19 10:01:12,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2024-11-19 10:01:12,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2024-11-19 10:01:12,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2024-11-19 10:01:12,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2024-11-19 10:01:12,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2024-11-19 10:01:12,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2024-11-19 10:01:12,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 10:01:12,713 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:01:12,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:01:13,083 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:01:13,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:01:13 BoogieIcfgContainer [2024-11-19 10:01:13,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:01:13,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:01:13,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:01:13,115 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:01:13,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:01:06" (3/4) ... [2024-11-19 10:01:13,118 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:01:13,122 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ReadFromPort [2024-11-19 10:01:13,128 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-19 10:01:13,129 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-19 10:01:13,129 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 10:01:13,129 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:01:13,130 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:01:13,242 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:01:13,243 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:01:13,243 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:01:13,244 INFO L158 Benchmark]: Toolchain (without parser) took 7785.45ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 154.4MB in the beginning and 110.7MB in the end (delta: 43.7MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2024-11-19 10:01:13,244 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:01:13,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.00ms. Allocated memory is still 188.7MB. Free memory was 154.4MB in the beginning and 141.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:01:13,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.24ms. Allocated memory is still 188.7MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:01:13,244 INFO L158 Benchmark]: Boogie Preprocessor took 43.63ms. Allocated memory is still 188.7MB. Free memory was 139.3MB in the beginning and 137.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:01:13,244 INFO L158 Benchmark]: RCFGBuilder took 638.68ms. Allocated memory is still 188.7MB. Free memory was 137.2MB in the beginning and 145.2MB in the end (delta: -8.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:01:13,245 INFO L158 Benchmark]: TraceAbstraction took 6654.45ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 144.1MB in the beginning and 117.0MB in the end (delta: 27.2MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2024-11-19 10:01:13,245 INFO L158 Benchmark]: Witness Printer took 128.25ms. Allocated memory is still 226.5MB. Free memory was 117.0MB in the beginning and 110.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 10:01:13,247 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.00ms. Allocated memory is still 188.7MB. Free memory was 154.4MB in the beginning and 141.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.24ms. Allocated memory is still 188.7MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.63ms. Allocated memory is still 188.7MB. Free memory was 139.3MB in the beginning and 137.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 638.68ms. Allocated memory is still 188.7MB. Free memory was 137.2MB in the beginning and 145.2MB in the end (delta: -8.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6654.45ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 144.1MB in the beginning and 117.0MB in the end (delta: 27.2MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * Witness Printer took 128.25ms. Allocated memory is still 226.5MB. Free memory was 117.0MB in the beginning and 110.7MB in the end (delta: 6.3MB). 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: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1420 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1392 mSDsluCounter, 1654 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 876 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1579 IncrementalHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 778 mSDtfsCounter, 1579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 610 GetRequests, 549 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=10, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 954 NumberOfCodeBlocks, 814 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1151 ConstructedInterpolants, 0 QuantifiedInterpolants, 2442 SizeOfPredicates, 2 NumberOfNonLiveVariables, 874 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 773/887 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 38 specifications checked. All of them hold - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((((((((SIZE >= 0) ? (SIZE % 4) : ((SIZE % 4) + 4)) == 0) && (i == 0)) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000)) || ((((((((SIZE >= 0) ? (SIZE % 4) : ((SIZE % 4) + 4)) == 0) && (1 <= i)) && (2 <= SIZE)) && (i <= 2147483646)) && (SIZE <= 99999)) && (MAX <= 100000))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 12]: Procedure Contract for ReadFromPort Derived contract for procedure ReadFromPort. Requires: ((((((SIZE >= 0) ? (SIZE % 4) : ((SIZE % 4) + 4)) == 0) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000)) Ensures: (((((((SIZE >= 0) ? (SIZE % 4) : ((SIZE % 4) + 4)) == 0) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000)) && ((SIZE == \old(SIZE)) && (MAX == \old(MAX)))) RESULT: Ultimate proved your program to be correct! [2024-11-19 10:01:13,280 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