./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-multidimensional/init-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 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-multidimensional/init-3-u.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 385b06dfd41f8b2cf291934cb4635d07bfe2a63001fa162165126d7b890c1d72 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:05:16,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:05:16,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:05:16,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:05:16,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:05:16,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:05:16,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:05:16,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:05:16,394 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:05:16,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:05:16,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:05:16,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:05:16,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:05:16,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:05:16,400 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:05:16,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:05:16,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:05:16,400 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:05:16,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:05:16,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:05:16,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:05:16,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:05:16,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:05:16,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:05:16,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:05:16,403 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:05:16,404 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:05:16,404 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:05:16,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:05:16,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:05:16,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:05:16,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:05:16,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:05:16,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:05:16,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:05:16,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:05:16,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:05:16,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:05:16,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:05:16,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:05:16,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:05:16,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:05:16,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:05:16,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:05:16,408 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 -> 385b06dfd41f8b2cf291934cb4635d07bfe2a63001fa162165126d7b890c1d72 [2024-10-14 20:05:16,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:05:16,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:05:16,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:05:16,692 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:05:16,692 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:05:16,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-3-u.c [2024-10-14 20:05:18,077 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:05:18,255 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:05:18,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-3-u.c [2024-10-14 20:05:18,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650f90569/bc5e482ad6d14c2ebba7bd7366a3c1ea/FLAGcead6b8b0 [2024-10-14 20:05:18,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650f90569/bc5e482ad6d14c2ebba7bd7366a3c1ea [2024-10-14 20:05:18,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:05:18,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:05:18,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:05:18,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:05:18,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:05:18,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db2b8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18, skipping insertion in model container [2024-10-14 20:05:18,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:05:18,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:05:18,481 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:05:18,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:05:18,535 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:05:18,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18 WrapperNode [2024-10-14 20:05:18,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:05:18,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:05:18,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:05:18,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:05:18,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,572 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2024-10-14 20:05:18,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:05:18,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:05:18,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:05:18,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:05:18,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,603 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-14 20:05:18,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:05:18,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:05:18,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:05:18,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:05:18,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18" (1/1) ... [2024-10-14 20:05:18,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:05:18,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:05:18,666 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-14 20:05:18,684 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-14 20:05:18,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:05:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:05:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 20:05:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 20:05:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 20:05:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 20:05:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:05:18,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:05:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 20:05:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 20:05:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 20:05:18,822 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:05:18,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:05:19,029 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-14 20:05:19,030 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:05:19,072 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:05:19,072 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-14 20:05:19,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:05:19 BoogieIcfgContainer [2024-10-14 20:05:19,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:05:19,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:05:19,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:05:19,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:05:19,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:05:18" (1/3) ... [2024-10-14 20:05:19,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2102a1bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:05:19, skipping insertion in model container [2024-10-14 20:05:19,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:05:18" (2/3) ... [2024-10-14 20:05:19,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2102a1bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:05:19, skipping insertion in model container [2024-10-14 20:05:19,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:05:19" (3/3) ... [2024-10-14 20:05:19,082 INFO L112 eAbstractionObserver]: Analyzing ICFG init-3-u.c [2024-10-14 20:05:19,096 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:05:19,096 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-10-14 20:05:19,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:05:19,157 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;@6e3e516a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:05:19,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-14 20:05:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 35 states have internal predecessors, (48), 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-14 20:05:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 20:05:19,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:05:19,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 20:05:19,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-14 20:05:19,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:05:19,173 INFO L85 PathProgramCache]: Analyzing trace with hash 4509614, now seen corresponding path program 1 times [2024-10-14 20:05:19,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:05:19,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450783531] [2024-10-14 20:05:19,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:19,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:05:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:19,478 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-14 20:05:19,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:05:19,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450783531] [2024-10-14 20:05:19,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450783531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:05:19,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:05:19,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:05:19,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266257027] [2024-10-14 20:05:19,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:05:19,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:05:19,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:05:19,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:05:19,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:05:19,517 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 35 states have internal predecessors, (48), 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 4 states, 4 states have (on average 1.0) internal successors, (4), 3 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-14 20:05:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:05:19,664 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2024-10-14 20:05:19,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:05:19,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 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-14 20:05:19,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:05:19,677 INFO L225 Difference]: With dead ends: 89 [2024-10-14 20:05:19,677 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 20:05:19,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:05:19,683 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 56 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:05:19,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 42 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:05:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 20:05:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2024-10-14 20:05:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 47 states have internal predecessors, (59), 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-14 20:05:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-10-14 20:05:19,717 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 4 [2024-10-14 20:05:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:05:19,717 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-10-14 20:05:19,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 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-14 20:05:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-10-14 20:05:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 20:05:19,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:05:19,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 20:05:19,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:05:19,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-14 20:05:19,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:05:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash 139799521, now seen corresponding path program 1 times [2024-10-14 20:05:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:05:19,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99479725] [2024-10-14 20:05:19,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:05:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:19,797 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-14 20:05:19,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:05:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99479725] [2024-10-14 20:05:19,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99479725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:05:19,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:05:19,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:05:19,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035678205] [2024-10-14 20:05:19,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:05:19,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:05:19,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:05:19,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:05:19,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:05:19,804 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 20:05:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:05:19,856 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2024-10-14 20:05:19,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:05:19,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-14 20:05:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:05:19,858 INFO L225 Difference]: With dead ends: 68 [2024-10-14 20:05:19,858 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 20:05:19,858 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-14 20:05:19,859 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:05:19,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:05:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 20:05:19,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 20:05:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 63 states have internal predecessors, (79), 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-14 20:05:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2024-10-14 20:05:19,869 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 5 [2024-10-14 20:05:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:05:19,869 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2024-10-14 20:05:19,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 20:05:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2024-10-14 20:05:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:05:19,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:05:19,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:05:19,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:05:19,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-14 20:05:19,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:05:19,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1352316681, now seen corresponding path program 1 times [2024-10-14 20:05:19,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:05:19,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95731714] [2024-10-14 20:05:19,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:19,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:05:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:05:19,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:05:19,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95731714] [2024-10-14 20:05:19,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95731714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:05:19,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:05:19,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:05:19,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959534344] [2024-10-14 20:05:19,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:05:19,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:05:19,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:05:19,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:05:19,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:05:19,951 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:05:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:05:20,019 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2024-10-14 20:05:20,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:05:20,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 20:05:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:05:20,021 INFO L225 Difference]: With dead ends: 127 [2024-10-14 20:05:20,022 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 20:05:20,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:05:20,024 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 42 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:05:20,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 42 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:05:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 20:05:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 20:05:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 63 states have internal predecessors, (75), 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-14 20:05:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2024-10-14 20:05:20,036 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 8 [2024-10-14 20:05:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:05:20,036 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2024-10-14 20:05:20,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:05:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2024-10-14 20:05:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:05:20,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:05:20,038 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-14 20:05:20,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:05:20,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-14 20:05:20,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:05:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1350684576, now seen corresponding path program 1 times [2024-10-14 20:05:20,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:05:20,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652278936] [2024-10-14 20:05:20,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:20,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:05:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:05:20,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:05:20,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652278936] [2024-10-14 20:05:20,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652278936] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:05:20,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530714977] [2024-10-14 20:05:20,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:20,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:20,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:05:20,129 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-14 20:05:20,131 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-14 20:05:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:20,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:05:20,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:05:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:05:20,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:05:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530714977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:05:20,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:05:20,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-14 20:05:20,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023393794] [2024-10-14 20:05:20,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:05:20,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:05:20,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:05:20,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:05:20,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:05:20,295 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:05:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:05:20,378 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-10-14 20:05:20,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:05:20,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 20:05:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:05:20,380 INFO L225 Difference]: With dead ends: 64 [2024-10-14 20:05:20,380 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 20:05:20,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-14 20:05:20,381 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:05:20,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:05:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 20:05:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-14 20:05:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 61 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-14 20:05:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2024-10-14 20:05:20,390 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 8 [2024-10-14 20:05:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:05:20,390 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-10-14 20:05:20,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:05:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2024-10-14 20:05:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 20:05:20,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:05:20,392 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-10-14 20:05:20,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 20:05:20,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:20,593 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-14 20:05:20,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:05:20,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1078451167, now seen corresponding path program 1 times [2024-10-14 20:05:20,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:05:20,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292225587] [2024-10-14 20:05:20,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:20,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:05:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:05:20,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:05:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292225587] [2024-10-14 20:05:20,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292225587] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:05:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883170277] [2024-10-14 20:05:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:20,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:20,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:05:20,681 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-14 20:05:20,682 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-14 20:05:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:20,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:05:20,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:05:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:05:20,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:05:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:05:20,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883170277] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:05:20,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:05:20,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-14 20:05:20,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534663926] [2024-10-14 20:05:20,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:05:20,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:05:20,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:05:20,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:05:20,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:05:20,805 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-14 20:05:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:05:20,900 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2024-10-14 20:05:20,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:05:20,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 9 [2024-10-14 20:05:20,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:05:20,903 INFO L225 Difference]: With dead ends: 112 [2024-10-14 20:05:20,904 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 20:05:20,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:05:20,906 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 24 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:05:20,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 82 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:05:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 20:05:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-14 20:05:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 100 states have (on average 1.31) internal successors, (131), 109 states have internal predecessors, (131), 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-14 20:05:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2024-10-14 20:05:20,921 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 9 [2024-10-14 20:05:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:05:20,921 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2024-10-14 20:05:20,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-14 20:05:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2024-10-14 20:05:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 20:05:20,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:05:20,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:05:20,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 20:05:21,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:21,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-14 20:05:21,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:05:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1302822936, now seen corresponding path program 1 times [2024-10-14 20:05:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:05:21,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223021580] [2024-10-14 20:05:21,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:21,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:05:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:05:21,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:05:21,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223021580] [2024-10-14 20:05:21,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223021580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:05:21,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:05:21,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 20:05:21,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546910322] [2024-10-14 20:05:21,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:05:21,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:05:21,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:05:21,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:05:21,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:05:21,182 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-14 20:05:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:05:21,236 INFO L93 Difference]: Finished difference Result 218 states and 260 transitions. [2024-10-14 20:05:21,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:05:21,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2024-10-14 20:05:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:05:21,241 INFO L225 Difference]: With dead ends: 218 [2024-10-14 20:05:21,242 INFO L226 Difference]: Without dead ends: 214 [2024-10-14 20:05:21,242 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-14 20:05:21,243 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:05:21,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 49 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:05:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-14 20:05:21,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 208. [2024-10-14 20:05:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 198 states have (on average 1.292929292929293) internal successors, (256), 207 states have internal predecessors, (256), 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-14 20:05:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 256 transitions. [2024-10-14 20:05:21,274 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 256 transitions. Word has length 11 [2024-10-14 20:05:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:05:21,275 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 256 transitions. [2024-10-14 20:05:21,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-14 20:05:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 256 transitions. [2024-10-14 20:05:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:05:21,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:05:21,279 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 20:05:21,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:05:21,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-14 20:05:21,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:05:21,280 INFO L85 PathProgramCache]: Analyzing trace with hash 836672403, now seen corresponding path program 1 times [2024-10-14 20:05:21,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:05:21,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266923407] [2024-10-14 20:05:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:05:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:05:21,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:05:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266923407] [2024-10-14 20:05:21,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266923407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:05:21,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823910207] [2024-10-14 20:05:21,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:21,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:21,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:05:21,355 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-14 20:05:21,357 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-14 20:05:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:21,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:05:21,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:05:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:05:21,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:05:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:05:21,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823910207] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:05:21,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:05:21,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2024-10-14 20:05:21,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483738636] [2024-10-14 20:05:21,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:05:21,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 20:05:21,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:05:21,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 20:05:21,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:05:21,495 INFO L87 Difference]: Start difference. First operand 208 states and 256 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 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-14 20:05:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:05:21,815 INFO L93 Difference]: Finished difference Result 398 states and 488 transitions. [2024-10-14 20:05:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 20:05:21,816 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 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) Word has length 15 [2024-10-14 20:05:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:05:21,817 INFO L225 Difference]: With dead ends: 398 [2024-10-14 20:05:21,817 INFO L226 Difference]: Without dead ends: 208 [2024-10-14 20:05:21,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-10-14 20:05:21,819 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 212 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:05:21,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 65 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:05:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-14 20:05:21,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2024-10-14 20:05:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 198 states have (on average 1.1515151515151516) internal successors, (228), 205 states have internal predecessors, (228), 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-14 20:05:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 228 transitions. [2024-10-14 20:05:21,845 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 228 transitions. Word has length 15 [2024-10-14 20:05:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:05:21,845 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 228 transitions. [2024-10-14 20:05:21,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 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-14 20:05:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2024-10-14 20:05:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 20:05:21,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:05:21,849 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2024-10-14 20:05:21,867 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-14 20:05:22,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:22,051 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-14 20:05:22,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:05:22,051 INFO L85 PathProgramCache]: Analyzing trace with hash 412416318, now seen corresponding path program 2 times [2024-10-14 20:05:22,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:05:22,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246840066] [2024-10-14 20:05:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:05:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 20:05:22,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:05:22,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246840066] [2024-10-14 20:05:22,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246840066] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:05:22,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999763481] [2024-10-14 20:05:22,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:05:22,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:22,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:05:22,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:05:22,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 20:05:22,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 20:05:22,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:05:22,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:05:22,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:05:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 20:05:22,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:05:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 20:05:22,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999763481] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:05:22,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:05:22,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-14 20:05:22,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254358839] [2024-10-14 20:05:22,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:05:22,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:05:22,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:05:22,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:05:22,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:05:22,252 INFO L87 Difference]: Start difference. First operand 206 states and 228 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-14 20:05:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:05:22,307 INFO L93 Difference]: Finished difference Result 206 states and 228 transitions. [2024-10-14 20:05:22,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:05:22,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2024-10-14 20:05:22,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:05:22,309 INFO L225 Difference]: With dead ends: 206 [2024-10-14 20:05:22,309 INFO L226 Difference]: Without dead ends: 204 [2024-10-14 20:05:22,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:05:22,310 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:05:22,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 32 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:05:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-14 20:05:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 180. [2024-10-14 20:05:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 174 states have (on average 1.1264367816091954) internal successors, (196), 179 states have internal predecessors, (196), 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-14 20:05:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 196 transitions. [2024-10-14 20:05:22,328 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 196 transitions. Word has length 18 [2024-10-14 20:05:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:05:22,328 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 196 transitions. [2024-10-14 20:05:22,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-14 20:05:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 196 transitions. [2024-10-14 20:05:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 20:05:22,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:05:22,330 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1] [2024-10-14 20:05:22,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 20:05:22,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:22,535 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-14 20:05:22,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:05:22,535 INFO L85 PathProgramCache]: Analyzing trace with hash 735715557, now seen corresponding path program 1 times [2024-10-14 20:05:22,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:05:22,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590845010] [2024-10-14 20:05:22,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:22,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:05:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-14 20:05:22,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:05:22,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590845010] [2024-10-14 20:05:22,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590845010] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:05:22,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165320624] [2024-10-14 20:05:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:22,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:22,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:05:22,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:05:22,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 20:05:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:22,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 20:05:22,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:05:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:05:22,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:05:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:05:22,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165320624] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:05:22,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:05:22,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 16 [2024-10-14 20:05:22,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121742289] [2024-10-14 20:05:22,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:05:22,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 20:05:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:05:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 20:05:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-10-14 20:05:22,916 INFO L87 Difference]: Start difference. First operand 180 states and 196 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 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-14 20:05:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:05:23,577 INFO L93 Difference]: Finished difference Result 712 states and 826 transitions. [2024-10-14 20:05:23,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-14 20:05:23,579 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 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-14 20:05:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:05:23,581 INFO L225 Difference]: With dead ends: 712 [2024-10-14 20:05:23,581 INFO L226 Difference]: Without dead ends: 548 [2024-10-14 20:05:23,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2024-10-14 20:05:23,585 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 630 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:05:23,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 86 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:05:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-14 20:05:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2024-10-14 20:05:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 542 states have (on average 1.047970479704797) internal successors, (568), 547 states have internal predecessors, (568), 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-14 20:05:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 568 transitions. [2024-10-14 20:05:23,613 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 568 transitions. Word has length 34 [2024-10-14 20:05:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:05:23,614 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 568 transitions. [2024-10-14 20:05:23,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 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-14 20:05:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 568 transitions. [2024-10-14 20:05:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 20:05:23,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:05:23,623 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 3, 3, 3, 2, 1, 1, 1] [2024-10-14 20:05:23,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 20:05:23,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:23,827 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-14 20:05:23,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:05:23,828 INFO L85 PathProgramCache]: Analyzing trace with hash 134502350, now seen corresponding path program 2 times [2024-10-14 20:05:23,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:05:23,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566276497] [2024-10-14 20:05:23,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:23,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:05:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-10-14 20:05:24,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:05:24,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566276497] [2024-10-14 20:05:24,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566276497] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:05:24,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464533595] [2024-10-14 20:05:24,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:05:24,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:24,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:05:24,019 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:05:24,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 20:05:24,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 20:05:24,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:05:24,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:05:24,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:05:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-10-14 20:05:24,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:05:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-10-14 20:05:24,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464533595] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:05:24,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:05:24,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-14 20:05:24,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032207506] [2024-10-14 20:05:24,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:05:24,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:05:24,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:05:24,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:05:24,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:05:24,372 INFO L87 Difference]: Start difference. First operand 548 states and 568 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 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-14 20:05:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:05:24,427 INFO L93 Difference]: Finished difference Result 548 states and 568 transitions. [2024-10-14 20:05:24,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:05:24,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 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) Word has length 104 [2024-10-14 20:05:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:05:24,430 INFO L225 Difference]: With dead ends: 548 [2024-10-14 20:05:24,431 INFO L226 Difference]: Without dead ends: 546 [2024-10-14 20:05:24,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:05:24,432 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 63 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:05:24,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 24 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:05:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-10-14 20:05:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 374. [2024-10-14 20:05:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 370 states have (on average 1.0486486486486486) internal successors, (388), 373 states have internal predecessors, (388), 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-14 20:05:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 388 transitions. [2024-10-14 20:05:24,461 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 388 transitions. Word has length 104 [2024-10-14 20:05:24,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:05:24,463 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 388 transitions. [2024-10-14 20:05:24,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 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-14 20:05:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 388 transitions. [2024-10-14 20:05:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 20:05:24,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:05:24,467 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1] [2024-10-14 20:05:24,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 20:05:24,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:24,668 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-14 20:05:24,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:05:24,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1186030569, now seen corresponding path program 1 times [2024-10-14 20:05:24,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:05:24,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340765030] [2024-10-14 20:05:24,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:24,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:05:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 0 proven. 1303 refuted. 0 times theorem prover too weak. 1232 trivial. 0 not checked. [2024-10-14 20:05:24,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:05:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340765030] [2024-10-14 20:05:24,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340765030] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:05:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249319801] [2024-10-14 20:05:24,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:24,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:24,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:05:24,863 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:05:24,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 20:05:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:24,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 20:05:25,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:05:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 969 proven. 145 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2024-10-14 20:05:25,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:05:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2535 backedges. 969 proven. 145 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2024-10-14 20:05:25,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249319801] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:05:25,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:05:25,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 13, 13] total 27 [2024-10-14 20:05:25,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929131559] [2024-10-14 20:05:25,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:05:25,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 20:05:25,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:05:25,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 20:05:25,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2024-10-14 20:05:25,487 INFO L87 Difference]: Start difference. First operand 374 states and 388 transitions. Second operand has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 27 states have internal predecessors, (102), 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-14 20:05:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:05:26,859 INFO L93 Difference]: Finished difference Result 1096 states and 1220 transitions. [2024-10-14 20:05:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-14 20:05:26,859 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 27 states have internal predecessors, (102), 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 144 [2024-10-14 20:05:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:05:26,862 INFO L225 Difference]: With dead ends: 1096 [2024-10-14 20:05:26,862 INFO L226 Difference]: Without dead ends: 756 [2024-10-14 20:05:26,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1549, Invalid=3853, Unknown=0, NotChecked=0, Total=5402 [2024-10-14 20:05:26,865 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 849 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 20:05:26,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 154 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 20:05:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-14 20:05:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2024-10-14 20:05:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 754 states have (on average 1.0198938992042441) internal successors, (769), 755 states have internal predecessors, (769), 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-14 20:05:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 769 transitions. [2024-10-14 20:05:26,898 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 769 transitions. Word has length 144 [2024-10-14 20:05:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:05:26,899 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 769 transitions. [2024-10-14 20:05:26,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 27 states have internal predecessors, (102), 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-14 20:05:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 769 transitions. [2024-10-14 20:05:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-10-14 20:05:26,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:05:26,902 INFO L215 NwaCegarLoop]: trace histogram [88, 88, 88, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1] [2024-10-14 20:05:26,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 20:05:27,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:27,103 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-14 20:05:27,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:05:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash 367260292, now seen corresponding path program 1 times [2024-10-14 20:05:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:05:27,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40851176] [2024-10-14 20:05:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:27,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:05:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11872 backedges. 0 proven. 6008 refuted. 0 times theorem prover too weak. 5864 trivial. 0 not checked. [2024-10-14 20:05:27,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:05:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40851176] [2024-10-14 20:05:27,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40851176] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:05:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112151388] [2024-10-14 20:05:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:27,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:27,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:05:27,505 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:05:27,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 20:05:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:27,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 20:05:27,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:05:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11872 backedges. 4497 proven. 715 refuted. 0 times theorem prover too weak. 6660 trivial. 0 not checked. [2024-10-14 20:05:28,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:05:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 11872 backedges. 4497 proven. 715 refuted. 0 times theorem prover too weak. 6660 trivial. 0 not checked. [2024-10-14 20:05:29,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112151388] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:05:29,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:05:29,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 25, 25] total 51 [2024-10-14 20:05:29,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323779252] [2024-10-14 20:05:29,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:05:29,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 20:05:29,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:05:29,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 20:05:29,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1184, Invalid=1468, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 20:05:29,086 INFO L87 Difference]: Start difference. First operand 756 states and 769 transitions. Second operand has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 51 states have internal predecessors, (175), 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-14 20:05:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:05:34,004 INFO L93 Difference]: Finished difference Result 2970 states and 3292 transitions. [2024-10-14 20:05:34,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2024-10-14 20:05:34,005 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 51 states have internal predecessors, (175), 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 289 [2024-10-14 20:05:34,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:05:34,015 INFO L225 Difference]: With dead ends: 2970 [2024-10-14 20:05:34,016 INFO L226 Difference]: Without dead ends: 2284 [2024-10-14 20:05:34,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9180 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=9913, Invalid=18479, Unknown=0, NotChecked=0, Total=28392 [2024-10-14 20:05:34,023 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 3688 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3688 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 20:05:34,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3688 Valid, 139 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 20:05:34,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2024-10-14 20:05:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2284. [2024-10-14 20:05:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2282 states have (on average 1.00920245398773) internal successors, (2303), 2283 states have internal predecessors, (2303), 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-14 20:05:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 2303 transitions. [2024-10-14 20:05:34,110 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 2303 transitions. Word has length 289 [2024-10-14 20:05:34,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:05:34,111 INFO L471 AbstractCegarLoop]: Abstraction has 2284 states and 2303 transitions. [2024-10-14 20:05:34,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 51 states have internal predecessors, (175), 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-14 20:05:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 2303 transitions. [2024-10-14 20:05:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2024-10-14 20:05:34,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:05:34,130 INFO L215 NwaCegarLoop]: trace histogram [276, 276, 276, 6, 6, 6, 6, 3, 3, 3, 2, 1, 1] [2024-10-14 20:05:34,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 20:05:34,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 20:05:34,335 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-14 20:05:34,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:05:34,336 INFO L85 PathProgramCache]: Analyzing trace with hash 377257083, now seen corresponding path program 2 times [2024-10-14 20:05:34,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:05:34,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550593125] [2024-10-14 20:05:34,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:05:34,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:05:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:05:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 115596 backedges. 0 proven. 51566 refuted. 0 times theorem prover too weak. 64030 trivial. 0 not checked. [2024-10-14 20:05:35,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:05:35,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550593125] [2024-10-14 20:05:35,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550593125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:05:35,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979404360] [2024-10-14 20:05:35,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:05:35,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:05:35,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:05:35,419 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:05:35,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 20:05:35,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 20:05:35,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:05:35,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:05:35,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:05:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 115596 backedges. 0 proven. 51566 refuted. 0 times theorem prover too weak. 64030 trivial. 0 not checked. [2024-10-14 20:05:36,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:05:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 115596 backedges. 0 proven. 51566 refuted. 0 times theorem prover too weak. 64030 trivial. 0 not checked. [2024-10-14 20:05:37,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979404360] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:05:37,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:05:37,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-14 20:05:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369544434] [2024-10-14 20:05:37,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:05:37,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:05:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:05:37,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:05:37,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:05:37,507 INFO L87 Difference]: Start difference. First operand 2284 states and 2303 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-14 20:05:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:05:37,626 INFO L93 Difference]: Finished difference Result 2284 states and 2303 transitions. [2024-10-14 20:05:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:05:37,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 865 [2024-10-14 20:05:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:05:37,629 INFO L225 Difference]: With dead ends: 2284 [2024-10-14 20:05:37,629 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:05:37,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1732 GetRequests, 1726 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:05:37,632 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:05:37,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:05:37,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:05:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:05:37,635 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-14 20:05:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:05:37,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 865 [2024-10-14 20:05:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:05:37,638 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:05:37,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-14 20:05:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:05:37,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:05:37,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-10-14 20:05:37,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-10-14 20:05:37,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-10-14 20:05:37,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-10-14 20:05:37,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-10-14 20:05:37,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-10-14 20:05:37,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-10-14 20:05:37,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-10-14 20:05:37,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-10-14 20:05:37,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-10-14 20:05:37,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-10-14 20:05:37,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-10-14 20:05:37,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-14 20:05:37,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 20:05:37,848 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:05:37,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:05:45,078 WARN L286 SmtUtils]: Spent 7.20s on a formula simplification. DAG size of input: 465 DAG size of output: 406 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-14 20:05:50,774 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 465 DAG size of output: 406 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-14 20:05:55,897 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:05:55,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:05:55 BoogieIcfgContainer [2024-10-14 20:05:55,917 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:05:55,917 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:05:55,917 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:05:55,917 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:05:55,918 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:05:19" (3/4) ... [2024-10-14 20:05:55,919 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:05:55,925 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-14 20:05:55,925 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 20:05:55,925 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 20:05:55,925 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:05:56,012 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:05:56,012 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:05:56,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:05:56,013 INFO L158 Benchmark]: Toolchain (without parser) took 37735.37ms. Allocated memory was 138.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 67.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2024-10-14 20:05:56,013 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 138.4MB. Free memory is still 99.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:05:56,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.93ms. Allocated memory is still 138.4MB. Free memory was 67.6MB in the beginning and 56.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:05:56,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.35ms. Allocated memory is still 138.4MB. Free memory was 56.1MB in the beginning and 54.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:05:56,014 INFO L158 Benchmark]: Boogie Preprocessor took 46.90ms. Allocated memory is still 138.4MB. Free memory was 54.6MB in the beginning and 52.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:05:56,015 INFO L158 Benchmark]: RCFGBuilder took 451.62ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 52.6MB in the beginning and 136.5MB in the end (delta: -83.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-10-14 20:05:56,015 INFO L158 Benchmark]: TraceAbstraction took 36841.06ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 135.7MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 778.9MB. Max. memory is 16.1GB. [2024-10-14 20:05:56,015 INFO L158 Benchmark]: Witness Printer took 95.24ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:05:56,017 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.06ms. Allocated memory is still 138.4MB. Free memory is still 99.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.93ms. Allocated memory is still 138.4MB. Free memory was 67.6MB in the beginning and 56.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.35ms. Allocated memory is still 138.4MB. Free memory was 56.1MB in the beginning and 54.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.90ms. Allocated memory is still 138.4MB. Free memory was 54.6MB in the beginning and 52.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 451.62ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 52.6MB in the beginning and 136.5MB in the end (delta: -83.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * TraceAbstraction took 36841.06ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 135.7MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 778.9MB. Max. memory is 16.1GB. * Witness Printer took 95.24ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.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: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 13, TraceHistogramMax: 276, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5670 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5670 mSDsluCounter, 854 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 604 mSDsCounter, 881 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1437 IncrementalHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 881 mSolverCounterUnsat, 250 mSDtfsCounter, 1437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3184 GetRequests, 2854 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10960 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2284occurred in iteration=12, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 208 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 3000 NumberOfCodeBlocks, 2030 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4448 ConstructedInterpolants, 0 QuantifiedInterpolants, 12576 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1810 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 228862/394678 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: (((i == 0) && (n == 1000)) || (((1 <= i) && (i <= 2147483646)) && (n == 1000))) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((1 <= i) && (i <= 999)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1000)) || ((((((1 <= i) && (1 <= j)) && (i <= 999)) && (k == 0)) && (j <= 999)) && (n == 1000))) || (((((((1 <= i) && (1 <= j)) && (i <= 999)) && (k <= 2147483646)) && (1 <= k)) && (j <= 999)) && (n == 1000))) || ((((((i == 0) && (1 <= j)) && (k <= 2147483646)) && (1 <= k)) && (j <= 999)) && (n == 1000))) || (((((i == 0) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1000))) || (((((1 <= i) && (i <= 999)) && (k == 0)) && (j == 0)) && (n == 1000))) || (((((i == 0) && (1 <= j)) && (k == 0)) && (j <= 999)) && (n == 1000))) || ((((i == 0) && (k == 0)) && (j == 0)) && (n == 1000))) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((1 <= i) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1000)) || ((((i == 0) && (1 <= j)) && (j <= 2147483646)) && (n == 1000))) || (((i == 0) && (j == 0)) && (n == 1000))) || ((((1 <= i) && (i <= 999)) && (j == 0)) && (n == 1000))) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (((i == 0) && (n == 1000)) || (((1 <= i) && (i <= 2147483646)) && (n == 1000))) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((1 <= i) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1000)) || ((((i == 0) && (1 <= j)) && (j <= 2147483646)) && (n == 1000))) || (((i == 0) && (j == 0)) && (n == 1000))) || ((((1 <= i) && (i <= 999)) && (j == 0)) && (n == 1000))) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((1 <= i) && (i <= 999)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1000)) || ((((((1 <= i) && (1 <= j)) && (i <= 999)) && (k == 0)) && (j <= 999)) && (n == 1000))) || (((((((1 <= i) && (1 <= j)) && (i <= 999)) && (k <= 2147483646)) && (1 <= k)) && (j <= 999)) && (n == 1000))) || ((((((i == 0) && (1 <= j)) && (k <= 2147483646)) && (1 <= k)) && (j <= 999)) && (n == 1000))) || (((((i == 0) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1000))) || (((((1 <= i) && (i <= 999)) && (k == 0)) && (j == 0)) && (n == 1000))) || (((((i == 0) && (1 <= j)) && (k == 0)) && (j <= 999)) && (n == 1000))) || ((((i == 0) && (k == 0)) && (j == 0)) && (n == 1000))) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:05:56,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE