./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/rewnifrev.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/rewnifrev.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 62ffb246c1e6cc2a3d3d5a08bb5a65a9894a173aba5be4caac9150f1d27ccfed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:52:37,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:52:37,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 12:52:37,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:52:37,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:52:37,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:52:37,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:52:37,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:52:37,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:52:37,899 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:52:37,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:52:37,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:52:37,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:52:37,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:52:37,903 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:52:37,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:52:37,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 12:52:37,904 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:52:37,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:52:37,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:52:37,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:52:37,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 12:52:37,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:52:37,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 12:52:37,906 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:52:37,906 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 12:52:37,907 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:52:37,907 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:52:37,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 12:52:37,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:52:37,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:52:37,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:52:37,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:52:37,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:52:37,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:52:37,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:52:37,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:52:37,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 12:52:37,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:52:37,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:52:37,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:52:37,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:52:37,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:52:37,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:52:37,913 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 -> 62ffb246c1e6cc2a3d3d5a08bb5a65a9894a173aba5be4caac9150f1d27ccfed [2024-10-13 12:52:38,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:52:38,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:52:38,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:52:38,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:52:38,203 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:52:38,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/rewnifrev.c [2024-10-13 12:52:39,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:52:39,818 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:52:39,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/rewnifrev.c [2024-10-13 12:52:39,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54f8c02f/b3bdf23db73144d8878d0b343f603ec6/FLAG63e04dded [2024-10-13 12:52:39,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54f8c02f/b3bdf23db73144d8878d0b343f603ec6 [2024-10-13 12:52:39,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:52:39,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:52:39,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:52:39,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:52:39,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:52:39,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:52:39" (1/1) ... [2024-10-13 12:52:39,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318f4811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:39, skipping insertion in model container [2024-10-13 12:52:39,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:52:39" (1/1) ... [2024-10-13 12:52:39,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:52:40,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:52:40,050 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:52:40,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:52:40,080 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:52:40,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40 WrapperNode [2024-10-13 12:52:40,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:52:40,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:52:40,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:52:40,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:52:40,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40" (1/1) ... [2024-10-13 12:52:40,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40" (1/1) ... [2024-10-13 12:52:40,108 INFO L138 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-10-13 12:52:40,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:52:40,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:52:40,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:52:40,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:52:40,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40" (1/1) ... [2024-10-13 12:52:40,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40" (1/1) ... [2024-10-13 12:52:40,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40" (1/1) ... [2024-10-13 12:52:40,135 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-10-13 12:52:40,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40" (1/1) ... [2024-10-13 12:52:40,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40" (1/1) ... [2024-10-13 12:52:40,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40" (1/1) ... [2024-10-13 12:52:40,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40" (1/1) ... [2024-10-13 12:52:40,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40" (1/1) ... [2024-10-13 12:52:40,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40" (1/1) ... [2024-10-13 12:52:40,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:52:40,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:52:40,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:52:40,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:52:40,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40" (1/1) ... [2024-10-13 12:52:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:52:40,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:40,190 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-10-13 12:52:40,201 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-10-13 12:52:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:52:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:52:40,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 12:52:40,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 12:52:40,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 12:52:40,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 12:52:40,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:52:40,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:52:40,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 12:52:40,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 12:52:40,327 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:52:40,333 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:52:40,511 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 12:52:40,512 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:52:40,541 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:52:40,542 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 12:52:40,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:52:40 BoogieIcfgContainer [2024-10-13 12:52:40,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:52:40,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:52:40,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:52:40,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:52:40,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:52:39" (1/3) ... [2024-10-13 12:52:40,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ada31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:52:40, skipping insertion in model container [2024-10-13 12:52:40,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:40" (2/3) ... [2024-10-13 12:52:40,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ada31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:52:40, skipping insertion in model container [2024-10-13 12:52:40,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:52:40" (3/3) ... [2024-10-13 12:52:40,556 INFO L112 eAbstractionObserver]: Analyzing ICFG rewnifrev.c [2024-10-13 12:52:40,575 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:52:40,575 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-10-13 12:52:40,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:52:40,651 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;@28eb03bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:52:40,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-13 12:52:40,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.826086956521739) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 12:52:40,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:40,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 12:52:40,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:52:40,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash 111637, now seen corresponding path program 1 times [2024-10-13 12:52:40,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:40,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165850695] [2024-10-13 12:52:40,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:40,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:52:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:40,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165850695] [2024-10-13 12:52:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165850695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:40,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:40,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:52:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156627629] [2024-10-13 12:52:40,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:40,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:52:40,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:40,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:52:40,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:52:40,878 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.826086956521739) internal successors, (42), 35 states have internal predecessors, (42), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:40,917 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2024-10-13 12:52:40,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:52:40,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-10-13 12:52:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:40,927 INFO L225 Difference]: With dead ends: 49 [2024-10-13 12:52:40,927 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 12:52:40,929 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-10-13 12:52:40,932 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:40,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 29 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 12:52:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 12:52:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.619047619047619) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-10-13 12:52:40,964 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 3 [2024-10-13 12:52:40,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:40,966 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-10-13 12:52:40,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-10-13 12:52:40,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 12:52:40,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:40,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 12:52:40,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:52:40,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:52:40,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:40,969 INFO L85 PathProgramCache]: Analyzing trace with hash 3460786, now seen corresponding path program 1 times [2024-10-13 12:52:40,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:40,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31063990] [2024-10-13 12:52:40,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:40,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:52:41,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:41,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31063990] [2024-10-13 12:52:41,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31063990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:41,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:41,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:52:41,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959765160] [2024-10-13 12:52:41,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:41,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:52:41,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:41,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:52:41,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:52:41,032 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:41,047 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-10-13 12:52:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:52:41,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-10-13 12:52:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:41,049 INFO L225 Difference]: With dead ends: 32 [2024-10-13 12:52:41,049 INFO L226 Difference]: Without dead ends: 31 [2024-10-13 12:52:41,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-13 12:52:41,051 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:41,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 26 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-13 12:52:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-13 12:52:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-10-13 12:52:41,063 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 4 [2024-10-13 12:52:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:41,066 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-10-13 12:52:41,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-10-13 12:52:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 12:52:41,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:41,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:52:41,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:52:41,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:52:41,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:41,069 INFO L85 PathProgramCache]: Analyzing trace with hash -969150444, now seen corresponding path program 1 times [2024-10-13 12:52:41,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:41,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430986973] [2024-10-13 12:52:41,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:41,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:52:41,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:41,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430986973] [2024-10-13 12:52:41,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430986973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:41,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:41,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:52:41,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483355845] [2024-10-13 12:52:41,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:41,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:52:41,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:41,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:52:41,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:52:41,171 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:41,248 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-10-13 12:52:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:52:41,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 12:52:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:41,250 INFO L225 Difference]: With dead ends: 34 [2024-10-13 12:52:41,250 INFO L226 Difference]: Without dead ends: 31 [2024-10-13 12:52:41,251 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-10-13 12:52:41,252 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:41,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:52:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-13 12:52:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-10-13 12:52:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-10-13 12:52:41,265 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 6 [2024-10-13 12:52:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:41,265 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-10-13 12:52:41,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-10-13 12:52:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 12:52:41,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:41,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:41,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:52:41,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:52:41,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:41,270 INFO L85 PathProgramCache]: Analyzing trace with hash 21107359, now seen corresponding path program 1 times [2024-10-13 12:52:41,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:41,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887326952] [2024-10-13 12:52:41,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:41,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:52:41,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:41,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887326952] [2024-10-13 12:52:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887326952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:41,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:41,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:52:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507060769] [2024-10-13 12:52:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:41,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:52:41,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:41,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:52:41,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:41,365 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-10-13 12:52:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:41,462 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-10-13 12:52:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:52:41,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-10-13 12:52:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:41,464 INFO L225 Difference]: With dead ends: 41 [2024-10-13 12:52:41,464 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 12:52:41,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:52:41,466 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:41,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 19 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:52:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 12:52:41,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-10-13 12:52:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-10-13 12:52:41,474 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 7 [2024-10-13 12:52:41,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:41,474 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-13 12:52:41,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-10-13 12:52:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-10-13 12:52:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 12:52:41,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:41,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:41,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:52:41,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:52:41,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:41,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1744171954, now seen corresponding path program 1 times [2024-10-13 12:52:41,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:41,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96505735] [2024-10-13 12:52:41,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:41,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:52:41,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:41,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96505735] [2024-10-13 12:52:41,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96505735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:41,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:41,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:52:41,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498772358] [2024-10-13 12:52:41,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:41,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:52:41,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:41,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:52:41,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:41,562 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:41,625 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-10-13 12:52:41,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:52:41,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-10-13 12:52:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:41,627 INFO L225 Difference]: With dead ends: 61 [2024-10-13 12:52:41,627 INFO L226 Difference]: Without dead ends: 37 [2024-10-13 12:52:41,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:52:41,628 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:41,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 21 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-13 12:52:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-10-13 12:52:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-10-13 12:52:41,636 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 10 [2024-10-13 12:52:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:41,636 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-10-13 12:52:41,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-10-13 12:52:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 12:52:41,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:41,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:41,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:52:41,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:52:41,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1441660844, now seen corresponding path program 1 times [2024-10-13 12:52:41,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:41,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145388368] [2024-10-13 12:52:41,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:41,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:52:41,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:41,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145388368] [2024-10-13 12:52:41,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145388368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:41,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:41,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:52:41,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149441686] [2024-10-13 12:52:41,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:41,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:52:41,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:41,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:52:41,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:41,725 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:41,780 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-10-13 12:52:41,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:52:41,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-10-13 12:52:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:41,782 INFO L225 Difference]: With dead ends: 40 [2024-10-13 12:52:41,782 INFO L226 Difference]: Without dead ends: 39 [2024-10-13 12:52:41,783 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-10-13 12:52:41,785 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:41,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:52:41,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-13 12:52:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-10-13 12:52:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2024-10-13 12:52:41,792 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 14 [2024-10-13 12:52:41,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:41,792 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2024-10-13 12:52:41,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2024-10-13 12:52:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 12:52:41,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:41,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:41,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:52:41,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:52:41,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:41,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1741813276, now seen corresponding path program 1 times [2024-10-13 12:52:41,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:41,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857471317] [2024-10-13 12:52:41,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:41,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:52:41,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:41,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857471317] [2024-10-13 12:52:41,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857471317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:41,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:41,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:52:41,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155640090] [2024-10-13 12:52:41,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:41,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:52:41,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:41,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:52:41,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:41,882 INFO L87 Difference]: Start difference. First operand 38 states and 40 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-10-13 12:52:41,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:41,927 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-10-13 12:52:41,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:52:41,928 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-10-13 12:52:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:41,929 INFO L225 Difference]: With dead ends: 38 [2024-10-13 12:52:41,929 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 12:52:41,929 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-10-13 12:52:41,930 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:41,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 22 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:41,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 12:52:41,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-10-13 12:52:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-10-13 12:52:41,941 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 15 [2024-10-13 12:52:41,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:41,941 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-10-13 12:52:41,941 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-10-13 12:52:41,942 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-10-13 12:52:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 12:52:41,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:41,942 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:41,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:52:41,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:52:41,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:41,944 INFO L85 PathProgramCache]: Analyzing trace with hash -533830756, now seen corresponding path program 1 times [2024-10-13 12:52:41,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:41,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764968175] [2024-10-13 12:52:41,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:41,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:52:42,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:42,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764968175] [2024-10-13 12:52:42,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764968175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:42,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:42,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:52:42,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874708581] [2024-10-13 12:52:42,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:42,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:52:42,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:42,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:52:42,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:42,034 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:42,076 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-10-13 12:52:42,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:52:42,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-10-13 12:52:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:42,077 INFO L225 Difference]: With dead ends: 33 [2024-10-13 12:52:42,077 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 12:52:42,078 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-10-13 12:52:42,078 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:42,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 27 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 12:52:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2024-10-13 12:52:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-10-13 12:52:42,083 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2024-10-13 12:52:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:42,084 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-10-13 12:52:42,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-10-13 12:52:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 12:52:42,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:42,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:42,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:52:42,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:52:42,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash -565142928, now seen corresponding path program 1 times [2024-10-13 12:52:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:42,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120159099] [2024-10-13 12:52:42,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:52:42,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:42,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120159099] [2024-10-13 12:52:42,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120159099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:42,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:42,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:52:42,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689801671] [2024-10-13 12:52:42,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:42,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:52:42,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:42,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:52:42,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:42,187 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:42,234 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-10-13 12:52:42,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:52:42,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-10-13 12:52:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:42,235 INFO L225 Difference]: With dead ends: 34 [2024-10-13 12:52:42,235 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 12:52:42,235 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-10-13 12:52:42,236 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:42,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 12:52:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 12:52:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-10-13 12:52:42,245 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2024-10-13 12:52:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:42,245 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-10-13 12:52:42,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-10-13 12:52:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 12:52:42,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:42,249 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:42,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:52:42,249 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:52:42,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:42,250 INFO L85 PathProgramCache]: Analyzing trace with hash 584404106, now seen corresponding path program 1 times [2024-10-13 12:52:42,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:42,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557805394] [2024-10-13 12:52:42,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:42,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:52:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557805394] [2024-10-13 12:52:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557805394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:42,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:52:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418645031] [2024-10-13 12:52:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:42,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:52:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:42,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:52:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:52:42,341 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:42,391 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-10-13 12:52:42,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:52:42,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 26 [2024-10-13 12:52:42,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:42,392 INFO L225 Difference]: With dead ends: 49 [2024-10-13 12:52:42,392 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 12:52:42,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:52:42,393 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:42,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 32 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 12:52:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-13 12:52:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-10-13 12:52:42,400 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2024-10-13 12:52:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:42,401 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-10-13 12:52:42,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-10-13 12:52:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 12:52:42,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:42,403 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:42,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:52:42,404 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:52:42,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:42,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1821423494, now seen corresponding path program 1 times [2024-10-13 12:52:42,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:42,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676617124] [2024-10-13 12:52:42,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:42,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 12:52:42,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:42,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676617124] [2024-10-13 12:52:42,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676617124] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:52:42,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633553648] [2024-10-13 12:52:42,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:42,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:42,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:42,498 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-10-13 12:52:42,499 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-10-13 12:52:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:42,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:52:42,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:52:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 12:52:42,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:52:42,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633553648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:42,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:52:42,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-13 12:52:42,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621798757] [2024-10-13 12:52:42,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:42,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:52:42,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:42,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:52:42,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:52:42,661 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:42,781 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-10-13 12:52:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:52:42,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 33 [2024-10-13 12:52:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:42,782 INFO L225 Difference]: With dead ends: 36 [2024-10-13 12:52:42,785 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 12:52:42,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 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-10-13 12:52:42,786 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:42,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 25 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:52:42,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 12:52:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-13 12:52:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-10-13 12:52:42,792 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2024-10-13 12:52:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:42,792 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-10-13 12:52:42,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-10-13 12:52:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 12:52:42,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:42,794 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:42,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:52:42,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 12:52:42,999 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:52:42,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:43,000 INFO L85 PathProgramCache]: Analyzing trace with hash -629553365, now seen corresponding path program 1 times [2024-10-13 12:52:43,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:43,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651243324] [2024-10-13 12:52:43,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:43,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 12:52:43,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:43,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651243324] [2024-10-13 12:52:43,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651243324] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:52:43,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983553492] [2024-10-13 12:52:43,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:43,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:43,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:43,083 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-10-13 12:52:43,085 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-10-13 12:52:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:43,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:52:43,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:52:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 12:52:43,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:52:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 12:52:43,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983553492] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:52:43,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:52:43,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-13 12:52:43,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370085923] [2024-10-13 12:52:43,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:52:43,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 12:52:43,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:43,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 12:52:43,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:52:43,270 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:43,340 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-10-13 12:52:43,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:52:43,340 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 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 34 [2024-10-13 12:52:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:43,341 INFO L225 Difference]: With dead ends: 51 [2024-10-13 12:52:43,341 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 12:52:43,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 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-10-13 12:52:43,342 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:43,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:52:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 12:52:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-13 12:52:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-10-13 12:52:43,349 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 34 [2024-10-13 12:52:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:43,350 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-10-13 12:52:43,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2024-10-13 12:52:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 12:52:43,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:43,353 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:43,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 12:52:43,553 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,SelfDestructingSolverStorable11 [2024-10-13 12:52:43,553 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-13 12:52:43,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:43,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1600802971, now seen corresponding path program 2 times [2024-10-13 12:52:43,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:43,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620114868] [2024-10-13 12:52:43,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:43,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 12:52:43,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:43,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620114868] [2024-10-13 12:52:43,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620114868] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:52:43,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789543980] [2024-10-13 12:52:43,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:52:43,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:43,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:43,745 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-10-13 12:52:43,746 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-10-13 12:52:43,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:52:43,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:52:43,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:52:43,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:52:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-13 12:52:43,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:52:43,991 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-13 12:52:43,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789543980] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:52:43,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:52:43,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 3, 3] total 14 [2024-10-13 12:52:43,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633890017] [2024-10-13 12:52:43,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:52:43,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 12:52:43,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:43,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 12:52:43,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-13 12:52:43,993 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:44,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:44,219 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2024-10-13 12:52:44,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 12:52:44,220 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 15 states have internal predecessors, (71), 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 49 [2024-10-13 12:52:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:44,220 INFO L225 Difference]: With dead ends: 61 [2024-10-13 12:52:44,220 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 12:52:44,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-10-13 12:52:44,221 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:44,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 30 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:52:44,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 12:52:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 12:52:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 12:52:44,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2024-10-13 12:52:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:44,223 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 12:52:44,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 12:52:44,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 12:52:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-10-13 12:52:44,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-10-13 12:52:44,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-10-13 12:52:44,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-10-13 12:52:44,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-10-13 12:52:44,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-10-13 12:52:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-10-13 12:52:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-10-13 12:52:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-10-13 12:52:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-10-13 12:52:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-10-13 12:52:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-10-13 12:52:44,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 12:52:44,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:44,435 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:44,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 12:52:44,553 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:52:44,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:52:44 BoogieIcfgContainer [2024-10-13 12:52:44,567 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:52:44,567 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:52:44,567 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:52:44,567 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:52:44,568 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:52:40" (3/4) ... [2024-10-13 12:52:44,570 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 12:52:44,577 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-13 12:52:44,577 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 12:52:44,577 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 12:52:44,578 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 12:52:44,667 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 12:52:44,668 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 12:52:44,668 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:52:44,668 INFO L158 Benchmark]: Toolchain (without parser) took 4824.56ms. Allocated memory was 163.6MB in the beginning and 241.2MB in the end (delta: 77.6MB). Free memory was 108.7MB in the beginning and 79.2MB in the end (delta: 29.5MB). Peak memory consumption was 106.8MB. Max. memory is 16.1GB. [2024-10-13 12:52:44,668 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 163.6MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:52:44,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.67ms. Allocated memory is still 163.6MB. Free memory was 108.4MB in the beginning and 96.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 12:52:44,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.59ms. Allocated memory is still 163.6MB. Free memory was 96.1MB in the beginning and 94.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:52:44,669 INFO L158 Benchmark]: Boogie Preprocessor took 42.99ms. Allocated memory is still 163.6MB. Free memory was 94.6MB in the beginning and 93.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:52:44,670 INFO L158 Benchmark]: RCFGBuilder took 389.33ms. Allocated memory is still 163.6MB. Free memory was 92.5MB in the beginning and 77.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 12:52:44,670 INFO L158 Benchmark]: TraceAbstraction took 4019.13ms. Allocated memory was 163.6MB in the beginning and 241.2MB in the end (delta: 77.6MB). Free memory was 77.3MB in the beginning and 84.5MB in the end (delta: -7.2MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2024-10-13 12:52:44,670 INFO L158 Benchmark]: Witness Printer took 100.60ms. Allocated memory is still 241.2MB. Free memory was 84.5MB in the beginning and 79.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:52:44,671 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 163.6MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.67ms. Allocated memory is still 163.6MB. Free memory was 108.4MB in the beginning and 96.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.59ms. Allocated memory is still 163.6MB. Free memory was 96.1MB in the beginning and 94.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.99ms. Allocated memory is still 163.6MB. Free memory was 94.6MB in the beginning and 93.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.33ms. Allocated memory is still 163.6MB. Free memory was 92.5MB in the beginning and 77.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4019.13ms. Allocated memory was 163.6MB in the beginning and 241.2MB in the end (delta: 77.6MB). Free memory was 77.3MB in the beginning and 84.5MB in the end (delta: -7.2MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. * Witness Printer took 100.60ms. Allocated memory is still 241.2MB. Free memory was 84.5MB in the beginning and 79.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 402 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 603 IncrementalHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 199 mSDtfsCounter, 603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=12, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 359 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 858 SizeOfPredicates, 2 NumberOfNonLiveVariables, 273 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 156/257 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 12 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((2 <= SIZE) && (i <= 2147483648)) && (SIZE <= 2147483647)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((i == 0) && (2 <= SIZE)) && (SIZE <= 2147483647)) || ((((1 <= i) && (2 <= SIZE)) && (i <= 2147483648)) && (SIZE <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-13 12:52:44,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE