./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/reducercommutativity/max10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/max10-1.i -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 1223a7fef027dae15fda123c8ce40ec49dc779b7d5d627ded9a670697417439e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:00:12,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:00:13,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:00:13,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:00:13,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:00:13,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:00:13,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:00:13,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:00:13,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:00:13,083 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:00:13,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:00:13,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:00:13,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:00:13,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:00:13,087 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:00:13,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:00:13,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:00:13,088 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:00:13,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:00:13,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:00:13,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:00:13,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:00:13,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:00:13,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:00:13,093 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:00:13,108 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:00:13,108 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:00:13,108 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:00:13,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:00:13,109 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:00:13,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:00:13,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:00:13,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:00:13,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:00:13,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:00:13,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:00:13,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:00:13,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:00:13,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:00:13,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:00:13,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:00:13,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:00:13,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:00:13,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:00:13,112 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 -> 1223a7fef027dae15fda123c8ce40ec49dc779b7d5d627ded9a670697417439e [2024-11-19 10:00:13,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:00:13,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:00:13,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:00:13,440 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:00:13,440 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:00:13,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max10-1.i [2024-11-19 10:00:14,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:00:15,117 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:00:15,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i [2024-11-19 10:00:15,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ae706b5/46324f3807c24cee959846578905677a/FLAGaac19bfa4 [2024-11-19 10:00:15,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ae706b5/46324f3807c24cee959846578905677a [2024-11-19 10:00:15,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:00:15,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:00:15,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:00:15,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:00:15,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:00:15,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@809aea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15, skipping insertion in model container [2024-11-19 10:00:15,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:00:15,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:00:15,767 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:00:15,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:00:15,845 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:00:15,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15 WrapperNode [2024-11-19 10:00:15,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:00:15,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:00:15,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:00:15,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:00:15,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,894 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2024-11-19 10:00:15,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:00:15,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:00:15,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:00:15,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:00:15,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,936 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-19 10:00:15,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:00:15,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:00:15,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:00:15,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:00:15,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15" (1/1) ... [2024-11-19 10:00:15,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:00:15,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:00:15,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 10:00:15,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 10:00:16,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:00:16,044 INFO L130 BoogieDeclarations]: Found specification of procedure max [2024-11-19 10:00:16,044 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2024-11-19 10:00:16,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:00:16,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 10:00:16,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 10:00:16,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 10:00:16,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 10:00:16,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:00:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:00:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 10:00:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 10:00:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 10:00:16,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:00:16,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:00:16,396 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-19 10:00:16,396 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:00:16,414 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:00:16,415 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 10:00:16,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:00:16 BoogieIcfgContainer [2024-11-19 10:00:16,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:00:16,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:00:16,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:00:16,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:00:16,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:00:15" (1/3) ... [2024-11-19 10:00:16,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2faa1ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:00:16, skipping insertion in model container [2024-11-19 10:00:16,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:15" (2/3) ... [2024-11-19 10:00:16,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2faa1ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:00:16, skipping insertion in model container [2024-11-19 10:00:16,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:00:16" (3/3) ... [2024-11-19 10:00:16,427 INFO L112 eAbstractionObserver]: Analyzing ICFG max10-1.i [2024-11-19 10:00:16,444 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:00:16,444 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-19 10:00:16,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:00:16,521 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;@b566f8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:00:16,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 10:00:16,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 32 states have (on average 1.53125) internal successors, (49), 40 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 10:00:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 10:00:16,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:16,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 10:00:16,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:16,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:16,539 INFO L85 PathProgramCache]: Analyzing trace with hash 54464963, now seen corresponding path program 1 times [2024-11-19 10:00:16,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:16,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182686471] [2024-11-19 10:00:16,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:16,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:16,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-11-19 10:00:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182686471] [2024-11-19 10:00:16,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182686471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:00:16,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:00:16,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:00:16,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258913724] [2024-11-19 10:00:16,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:00:16,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:00:16,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:16,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:00:16,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:16,835 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.53125) internal successors, (49), 40 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-11-19 10:00:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:16,897 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2024-11-19 10:00:16,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:00:16,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-11-19 10:00:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:16,905 INFO L225 Difference]: With dead ends: 87 [2024-11-19 10:00:16,905 INFO L226 Difference]: Without dead ends: 41 [2024-11-19 10:00:16,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:16,912 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:16,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-19 10:00:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-19 10:00:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-19 10:00:16,947 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 5 [2024-11-19 10:00:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:16,948 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-19 10:00:16,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-11-19 10:00:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-19 10:00:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:00:16,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:16,948 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-19 10:00:16,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:00:16,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:16,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1177332607, now seen corresponding path program 1 times [2024-11-19 10:00:16,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:16,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692242554] [2024-11-19 10:00:16,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:16,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:00:17,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:17,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692242554] [2024-11-19 10:00:17,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692242554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:00:17,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125316480] [2024-11-19 10:00:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:17,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:00:17,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:00:17,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:00:17,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:00:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:17,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:00:17,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:00:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:00:17,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:00:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125316480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:00:17,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:00:17,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-19 10:00:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575061589] [2024-11-19 10:00:17,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:00:17,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:00:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:17,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:00:17,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:00:17,271 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:17,321 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-19 10:00:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:00:17,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-11-19 10:00:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:17,323 INFO L225 Difference]: With dead ends: 41 [2024-11-19 10:00:17,323 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 10:00:17,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:00:17,324 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:17,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 135 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:17,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 10:00:17,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 10:00:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-19 10:00:17,330 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 9 [2024-11-19 10:00:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:17,331 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-19 10:00:17,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-19 10:00:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 10:00:17,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:17,332 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2024-11-19 10:00:17,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:00:17,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:00:17,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:17,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2137572522, now seen corresponding path program 1 times [2024-11-19 10:00:17,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:17,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853606471] [2024-11-19 10:00:17,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:17,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:00:17,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:17,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853606471] [2024-11-19 10:00:17,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853606471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:00:17,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:00:17,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:00:17,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341111409] [2024-11-19 10:00:17,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:00:17,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:00:17,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:17,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:00:17,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:17,618 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:17,641 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-19 10:00:17,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:00:17,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-19 10:00:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:17,645 INFO L225 Difference]: With dead ends: 40 [2024-11-19 10:00:17,645 INFO L226 Difference]: Without dead ends: 39 [2024-11-19 10:00:17,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:17,646 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:17,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-19 10:00:17,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-19 10:00:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-19 10:00:17,653 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2024-11-19 10:00:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:17,653 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-19 10:00:17,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-19 10:00:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:00:17,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:17,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:17,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:00:17,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:17,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash 127439927, now seen corresponding path program 1 times [2024-11-19 10:00:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:17,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121675592] [2024-11-19 10:00:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:17,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:00:17,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:17,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121675592] [2024-11-19 10:00:17,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121675592] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:00:17,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147330924] [2024-11-19 10:00:17,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:17,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:00:17,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:00:17,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:00:17,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 10:00:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:17,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:00:17,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:00:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:00:17,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:00:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:00:17,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147330924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:00:17,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:00:17,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 10:00:17,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602633765] [2024-11-19 10:00:17,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:00:17,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:00:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:17,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:00:17,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:00:17,903 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:17,953 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2024-11-19 10:00:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:00:17,954 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 10:00:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:17,955 INFO L225 Difference]: With dead ends: 73 [2024-11-19 10:00:17,955 INFO L226 Difference]: Without dead ends: 44 [2024-11-19 10:00:17,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:00:17,957 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:17,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 170 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:17,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-19 10:00:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-19 10:00:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-19 10:00:17,966 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 15 [2024-11-19 10:00:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:17,966 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-19 10:00:17,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-19 10:00:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 10:00:17,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:17,968 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:17,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 10:00:18,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-19 10:00:18,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:18,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:18,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1931603025, now seen corresponding path program 2 times [2024-11-19 10:00:18,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:18,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094345434] [2024-11-19 10:00:18,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:00:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:18,195 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:00:18,195 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:00:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 10:00:18,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:18,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094345434] [2024-11-19 10:00:18,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094345434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:00:18,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:00:18,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:00:18,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258758534] [2024-11-19 10:00:18,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:00:18,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:00:18,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:18,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:00:18,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:18,256 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:18,295 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2024-11-19 10:00:18,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:00:18,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-19 10:00:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:18,298 INFO L225 Difference]: With dead ends: 77 [2024-11-19 10:00:18,300 INFO L226 Difference]: Without dead ends: 50 [2024-11-19 10:00:18,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:18,302 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:18,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 101 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-19 10:00:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-19 10:00:18,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.275) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-19 10:00:18,314 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2024-11-19 10:00:18,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:18,315 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-19 10:00:18,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-19 10:00:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 10:00:18,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:18,320 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:18,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:00:18,320 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:18,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:18,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2024256696, now seen corresponding path program 1 times [2024-11-19 10:00:18,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:18,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802426955] [2024-11-19 10:00:18,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:18,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:18,536 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 10:00:18,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:18,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802426955] [2024-11-19 10:00:18,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802426955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:00:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746303195] [2024-11-19 10:00:18,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:18,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:00:18,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:00:18,540 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:00:18,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 10:00:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:18,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 10:00:18,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:00:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 10:00:18,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:00:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 10:00:18,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746303195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:00:18,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:00:18,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-19 10:00:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785303288] [2024-11-19 10:00:18,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:00:18,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 10:00:18,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:18,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 10:00:18,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 10:00:18,812 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:18,890 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2024-11-19 10:00:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 10:00:18,890 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-19 10:00:18,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:18,895 INFO L225 Difference]: With dead ends: 101 [2024-11-19 10:00:18,895 INFO L226 Difference]: Without dead ends: 66 [2024-11-19 10:00:18,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 10:00:18,896 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:18,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 172 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:00:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-19 10:00:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-19 10:00:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 62 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-19 10:00:18,910 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 29 [2024-11-19 10:00:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:18,911 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-19 10:00:18,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-19 10:00:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 10:00:18,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:18,913 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:18,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 10:00:19,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:00:19,118 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:19,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:19,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1580822072, now seen corresponding path program 2 times [2024-11-19 10:00:19,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:19,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31394257] [2024-11-19 10:00:19,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:00:19,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:19,145 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:00:19,146 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:00:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-19 10:00:19,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:19,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31394257] [2024-11-19 10:00:19,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31394257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:00:19,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465360377] [2024-11-19 10:00:19,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:00:19,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:00:19,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:00:19,271 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:00:19,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 10:00:19,344 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:00:19,345 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:00:19,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 10:00:19,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:00:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 10:00:19,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:00:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 10:00:19,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465360377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:00:19,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:00:19,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 25 [2024-11-19 10:00:19,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500603090] [2024-11-19 10:00:19,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:00:19,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 10:00:19,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:19,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 10:00:19,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2024-11-19 10:00:19,921 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:20,069 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2024-11-19 10:00:20,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 10:00:20,071 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-19 10:00:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:20,072 INFO L225 Difference]: With dead ends: 112 [2024-11-19 10:00:20,072 INFO L226 Difference]: Without dead ends: 77 [2024-11-19 10:00:20,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 59 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2024-11-19 10:00:20,075 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:20,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 283 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:00:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-19 10:00:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-19 10:00:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2024-11-19 10:00:20,089 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 45 [2024-11-19 10:00:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:20,089 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2024-11-19 10:00:20,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2024-11-19 10:00:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 10:00:20,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:20,091 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:20,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 10:00:20,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:00:20,292 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:20,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash -420581305, now seen corresponding path program 1 times [2024-11-19 10:00:20,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:20,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096114417] [2024-11-19 10:00:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2024-11-19 10:00:20,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:20,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096114417] [2024-11-19 10:00:20,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096114417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:00:20,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:00:20,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:00:20,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457420171] [2024-11-19 10:00:20,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:00:20,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:00:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:20,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:00:20,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:20,373 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:20,389 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-11-19 10:00:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:00:20,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-19 10:00:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:20,391 INFO L225 Difference]: With dead ends: 77 [2024-11-19 10:00:20,391 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 10:00:20,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:20,392 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:20,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 10:00:20,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2024-11-19 10:00:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-19 10:00:20,403 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 58 [2024-11-19 10:00:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:20,403 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-19 10:00:20,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-19 10:00:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 10:00:20,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:20,405 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:20,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:00:20,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:20,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:20,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1413037542, now seen corresponding path program 1 times [2024-11-19 10:00:20,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:20,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005042308] [2024-11-19 10:00:20,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:20,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-19 10:00:20,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:20,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005042308] [2024-11-19 10:00:20,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005042308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:00:20,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620301144] [2024-11-19 10:00:20,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:20,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:00:20,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:00:20,563 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:00:20,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 10:00:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:20,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 10:00:20,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:00:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-11-19 10:00:20,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:00:20,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620301144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:00:20,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:00:20,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-19 10:00:20,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111323865] [2024-11-19 10:00:20,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:00:20,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:00:20,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:20,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:00:20,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:00:20,674 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:00:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:20,695 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2024-11-19 10:00:20,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:00:20,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2024-11-19 10:00:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:20,696 INFO L225 Difference]: With dead ends: 74 [2024-11-19 10:00:20,696 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 10:00:20,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:00:20,697 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:20,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 10:00:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-19 10:00:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.109375) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-19 10:00:20,704 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 72 [2024-11-19 10:00:20,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:20,705 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-19 10:00:20,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:00:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-19 10:00:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-19 10:00:20,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:20,707 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:20,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 10:00:20,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:00:20,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:20,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash -854490749, now seen corresponding path program 1 times [2024-11-19 10:00:20,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:20,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061212368] [2024-11-19 10:00:20,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:20,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-19 10:00:21,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:21,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061212368] [2024-11-19 10:00:21,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061212368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:00:21,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480846644] [2024-11-19 10:00:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:21,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:00:21,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:00:21,057 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:00:21,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 10:00:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:21,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 10:00:21,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:00:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-11-19 10:00:21,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:00:21,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480846644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:00:21,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:00:21,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-19 10:00:21,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979305586] [2024-11-19 10:00:21,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:00:21,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:00:21,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:21,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:00:21,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:00:21,177 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:00:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:21,193 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-11-19 10:00:21,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:00:21,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2024-11-19 10:00:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:21,194 INFO L225 Difference]: With dead ends: 74 [2024-11-19 10:00:21,194 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 10:00:21,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:00:21,195 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:21,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 10:00:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-19 10:00:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-19 10:00:21,209 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 73 [2024-11-19 10:00:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:21,210 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-19 10:00:21,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:00:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-19 10:00:21,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 10:00:21,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:21,212 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:21,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 10:00:21,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:00:21,413 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:21,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:21,414 INFO L85 PathProgramCache]: Analyzing trace with hash -826853211, now seen corresponding path program 1 times [2024-11-19 10:00:21,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:21,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035225104] [2024-11-19 10:00:21,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:21,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-19 10:00:21,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:21,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035225104] [2024-11-19 10:00:21,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035225104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:00:21,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223700519] [2024-11-19 10:00:21,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:21,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:00:21,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:00:21,511 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:00:21,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 10:00:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:21,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:00:21,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:00:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-19 10:00:21,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:00:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-19 10:00:21,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223700519] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:00:21,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:00:21,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 10:00:21,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145685942] [2024-11-19 10:00:21,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:00:21,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:00:21,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:21,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:00:21,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:00:21,675 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 10:00:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:21,704 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2024-11-19 10:00:21,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:00:21,705 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 75 [2024-11-19 10:00:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:21,706 INFO L225 Difference]: With dead ends: 111 [2024-11-19 10:00:21,706 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 10:00:21,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:00:21,706 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:21,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 146 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 10:00:21,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 10:00:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:21,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-11-19 10:00:21,713 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 75 [2024-11-19 10:00:21,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:21,715 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-11-19 10:00:21,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 10:00:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-11-19 10:00:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 10:00:21,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:21,716 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:21,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 10:00:21,917 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-11-19 10:00:21,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:21,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash -226141083, now seen corresponding path program 2 times [2024-11-19 10:00:21,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:21,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806875766] [2024-11-19 10:00:21,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:00:21,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:21,941 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:00:21,941 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:00:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-11-19 10:00:21,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:21,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806875766] [2024-11-19 10:00:21,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806875766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:00:21,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:00:21,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:00:21,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513938127] [2024-11-19 10:00:21,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:00:21,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:00:21,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:21,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:00:21,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:21,973 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:00:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:21,993 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-19 10:00:21,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:00:21,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2024-11-19 10:00:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:21,996 INFO L225 Difference]: With dead ends: 84 [2024-11-19 10:00:21,996 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 10:00:21,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:21,997 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:21,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 72 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 10:00:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 10:00:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 78 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-11-19 10:00:22,005 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 99 [2024-11-19 10:00:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:22,005 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-19 10:00:22,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:00:22,006 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-11-19 10:00:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 10:00:22,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:22,008 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:22,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 10:00:22,008 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:22,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:22,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1579561118, now seen corresponding path program 1 times [2024-11-19 10:00:22,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:22,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404993410] [2024-11-19 10:00:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:22,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-11-19 10:00:22,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:22,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404993410] [2024-11-19 10:00:22,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404993410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:00:22,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:00:22,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:00:22,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036695358] [2024-11-19 10:00:22,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:00:22,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:00:22,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:22,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:00:22,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:22,134 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:00:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:22,157 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2024-11-19 10:00:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:00:22,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-19 10:00:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:22,158 INFO L225 Difference]: With dead ends: 86 [2024-11-19 10:00:22,158 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 10:00:22,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:22,159 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:22,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 10:00:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-19 10:00:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.0875) internal successors, (87), 81 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-19 10:00:22,169 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 100 [2024-11-19 10:00:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:22,170 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-19 10:00:22,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:00:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-19 10:00:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 10:00:22,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:22,172 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:22,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 10:00:22,172 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:22,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1043659805, now seen corresponding path program 1 times [2024-11-19 10:00:22,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:22,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161291879] [2024-11-19 10:00:22,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:22,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-19 10:00:22,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:22,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161291879] [2024-11-19 10:00:22,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161291879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:00:22,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:00:22,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:00:22,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108165976] [2024-11-19 10:00:22,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:00:22,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:00:22,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:22,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:00:22,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:00:22,248 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:00:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:22,259 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2024-11-19 10:00:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:00:22,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2024-11-19 10:00:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:22,260 INFO L225 Difference]: With dead ends: 85 [2024-11-19 10:00:22,261 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 10:00:22,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:00:22,261 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:22,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 10:00:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 10:00:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:00:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-11-19 10:00:22,271 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 103 [2024-11-19 10:00:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:22,272 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-11-19 10:00:22,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:00:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-11-19 10:00:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 10:00:22,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:22,273 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:22,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 10:00:22,273 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:00:22,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash 401089412, now seen corresponding path program 1 times [2024-11-19 10:00:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:22,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19201267] [2024-11-19 10:00:22,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:22,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-19 10:00:22,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:22,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19201267] [2024-11-19 10:00:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19201267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:00:22,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:00:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:00:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737761804] [2024-11-19 10:00:22,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:00:22,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:00:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:00:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:22,369 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:00:22,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:22,384 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-19 10:00:22,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:00:22,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 106 [2024-11-19 10:00:22,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:22,385 INFO L225 Difference]: With dead ends: 84 [2024-11-19 10:00:22,386 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:00:22,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:22,388 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:22,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:00:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:00:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:00:22,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2024-11-19 10:00:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:22,391 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:00:22,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:00:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:00:22,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:00:22,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-19 10:00:22,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-19 10:00:22,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-19 10:00:22,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-19 10:00:22,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-19 10:00:22,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-19 10:00:22,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-19 10:00:22,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-19 10:00:22,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 10:00:22,398 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:22,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:00:22,435 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:00:22,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:00:22 BoogieIcfgContainer [2024-11-19 10:00:22,455 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:00:22,455 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:00:22,455 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:00:22,456 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:00:22,456 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:00:16" (3/4) ... [2024-11-19 10:00:22,458 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:00:22,462 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure max [2024-11-19 10:00:22,467 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-19 10:00:22,468 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 10:00:22,468 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 10:00:22,468 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:00:22,564 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:00:22,565 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:00:22,565 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:00:22,565 INFO L158 Benchmark]: Toolchain (without parser) took 7057.28ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 96.7MB in the beginning and 102.4MB in the end (delta: -5.7MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-11-19 10:00:22,566 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 174.1MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:00:22,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.89ms. Allocated memory is still 174.1MB. Free memory was 96.4MB in the beginning and 142.7MB in the end (delta: -46.2MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-19 10:00:22,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.57ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 145.9MB in the end (delta: -3.3MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-11-19 10:00:22,566 INFO L158 Benchmark]: Boogie Preprocessor took 58.52ms. Allocated memory is still 174.1MB. Free memory was 145.9MB in the beginning and 143.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:00:22,567 INFO L158 Benchmark]: RCFGBuilder took 457.70ms. Allocated memory is still 174.1MB. Free memory was 143.7MB in the beginning and 135.6MB in the end (delta: 8.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 10:00:22,568 INFO L158 Benchmark]: TraceAbstraction took 6036.98ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 134.5MB in the beginning and 107.6MB in the end (delta: 26.9MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2024-11-19 10:00:22,568 INFO L158 Benchmark]: Witness Printer took 109.71ms. Allocated memory is still 209.7MB. Free memory was 107.6MB in the beginning and 102.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:00:22,569 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97ms. Allocated memory is still 174.1MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.89ms. Allocated memory is still 174.1MB. Free memory was 96.4MB in the beginning and 142.7MB in the end (delta: -46.2MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.57ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 145.9MB in the end (delta: -3.3MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.52ms. Allocated memory is still 174.1MB. Free memory was 145.9MB in the beginning and 143.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 457.70ms. Allocated memory is still 174.1MB. Free memory was 143.7MB in the beginning and 135.6MB in the end (delta: 8.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6036.98ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 134.5MB in the beginning and 107.6MB in the end (delta: 26.9MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. * Witness Printer took 109.71ms. Allocated memory is still 209.7MB. Free memory was 107.6MB in the beginning and 102.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 15, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 1719 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1237 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 476 IncrementalHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 482 mSDtfsCounter, 476 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 438 SyntacticMatches, 11 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=13, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1140 NumberOfCodeBlocks, 1045 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1278 ConstructedInterpolants, 0 QuantifiedInterpolants, 1700 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1189 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 26 InterpolantComputations, 11 PerfectInterpolantSequences, 2913/3204 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 8 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((i == 0) || (0 < i)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (0 < ((long long) i + 1)) RESULT: Ultimate proved your program to be correct! [2024-11-19 10:00:22,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE