./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max60-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max60-2.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 6dbb3c8dbc9ecf6e4f72a22b68126998e2267c3eb50185a59b3a9d03df64099d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:52:05,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:52:05,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 12:52:05,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:52:05,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:52:05,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:52:05,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:52:05,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:52:05,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:52:05,801 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:52:05,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:52:05,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:52:05,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:52:05,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:52:05,803 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:52:05,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:52:05,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 12:52:05,804 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:52:05,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:52:05,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:52:05,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:52:05,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 12:52:05,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:52:05,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 12:52:05,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:52:05,807 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 12:52:05,807 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:52:05,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:52:05,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 12:52:05,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:52:05,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:52:05,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:52:05,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:52:05,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:52:05,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:52:05,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:52:05,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:52:05,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 12:52:05,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:52:05,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:52:05,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:52:05,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:52:05,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:52:05,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:52:05,811 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 -> 6dbb3c8dbc9ecf6e4f72a22b68126998e2267c3eb50185a59b3a9d03df64099d [2024-10-13 12:52:06,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:52:06,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:52:06,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:52:06,024 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:52:06,025 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:52:06,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max60-2.i [2024-10-13 12:52:07,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:52:07,364 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:52:07,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max60-2.i [2024-10-13 12:52:07,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ea9552c/06d567ce400444c197519f5a8fdf3603/FLAGb95bccf60 [2024-10-13 12:52:07,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ea9552c/06d567ce400444c197519f5a8fdf3603 [2024-10-13 12:52:07,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:52:07,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:52:07,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:52:07,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:52:07,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:52:07,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:07,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7639252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07, skipping insertion in model container [2024-10-13 12:52:07,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:07,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:52:07,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:52:07,953 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:52:07,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:52:07,982 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:52:07,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07 WrapperNode [2024-10-13 12:52:07,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:52:07,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:52:07,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:52:07,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:52:07,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:07,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:08,008 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2024-10-13 12:52:08,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:52:08,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:52:08,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:52:08,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:52:08,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:08,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:08,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:08,043 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-10-13 12:52:08,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:08,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:08,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:08,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:08,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:08,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:08,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:52:08,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:52:08,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:52:08,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:52:08,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07" (1/1) ... [2024-10-13 12:52:08,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:52:08,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:08,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:52:08,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:52:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:52:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure max [2024-10-13 12:52:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2024-10-13 12:52:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:52:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 12:52:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 12:52:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 12:52:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 12:52:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:52:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:52:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 12:52:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 12:52:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 12:52:08,222 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:52:08,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:52:08,350 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-13 12:52:08,350 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:52:08,378 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:52:08,379 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 12:52:08,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:52:08 BoogieIcfgContainer [2024-10-13 12:52:08,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:52:08,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:52:08,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:52:08,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:52:08,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:52:07" (1/3) ... [2024-10-13 12:52:08,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f857b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:52:08, skipping insertion in model container [2024-10-13 12:52:08,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:52:07" (2/3) ... [2024-10-13 12:52:08,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f857b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:52:08, skipping insertion in model container [2024-10-13 12:52:08,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:52:08" (3/3) ... [2024-10-13 12:52:08,387 INFO L112 eAbstractionObserver]: Analyzing ICFG max60-2.i [2024-10-13 12:52:08,400 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:52:08,401 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 12:52:08,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:52:08,447 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;@70a7dd3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:52:08,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 12:52:08,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 25 states have (on average 1.68) internal successors, (42), 33 states have internal predecessors, (42), 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-10-13 12:52:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 12:52:08,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:08,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 12:52:08,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:08,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:08,459 INFO L85 PathProgramCache]: Analyzing trace with hash 131077, now seen corresponding path program 1 times [2024-10-13 12:52:08,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:08,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134562176] [2024-10-13 12:52:08,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:52:08,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:08,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134562176] [2024-10-13 12:52:08,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134562176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:08,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:08,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:52:08,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623843247] [2024-10-13 12:52:08,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:08,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:52:08,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:08,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:52:08,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:08,673 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.68) internal successors, (42), 33 states have internal predecessors, (42), 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.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:08,732 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2024-10-13 12:52:08,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:52:08,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 12:52:08,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:08,740 INFO L225 Difference]: With dead ends: 74 [2024-10-13 12:52:08,740 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 12:52:08,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:08,747 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:08,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:08,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 12:52:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-13 12:52:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 31 states have internal predecessors, (35), 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-10-13 12:52:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-10-13 12:52:08,778 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 3 [2024-10-13 12:52:08,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:08,778 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-13 12:52:08,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-10-13 12:52:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 12:52:08,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:08,780 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2024-10-13 12:52:08,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:52:08,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:08,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash -389978011, now seen corresponding path program 1 times [2024-10-13 12:52:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:08,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397938417] [2024-10-13 12:52:08,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:08,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:52:08,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:08,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397938417] [2024-10-13 12:52:08,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397938417] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:52:08,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977911298] [2024-10-13 12:52:08,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:08,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:08,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:08,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:52:08,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 12:52:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:08,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:52:08,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:52:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:52:09,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:52:09,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977911298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:09,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:52:09,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-13 12:52:09,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577681447] [2024-10-13 12:52:09,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:09,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:52:09,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:09,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:52:09,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:52:09,018 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:09,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:09,051 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-10-13 12:52:09,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:52:09,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 12:52:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:09,052 INFO L225 Difference]: With dead ends: 35 [2024-10-13 12:52:09,052 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 12:52:09,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:52:09,053 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:09,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 12:52:09,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-13 12:52:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 30 states have internal predecessors, (34), 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-10-13 12:52:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-10-13 12:52:09,061 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 6 [2024-10-13 12:52:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:09,062 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-10-13 12:52:09,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-10-13 12:52:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 12:52:09,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:09,063 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2024-10-13 12:52:09,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 12:52:09,267 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-10-13 12:52:09,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:09,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:09,269 INFO L85 PathProgramCache]: Analyzing trace with hash 795583620, now seen corresponding path program 1 times [2024-10-13 12:52:09,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:09,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762946130] [2024-10-13 12:52:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:09,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:52:09,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:09,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762946130] [2024-10-13 12:52:09,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762946130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:09,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:09,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:52:09,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4911069] [2024-10-13 12:52:09,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:09,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:52:09,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:09,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:52:09,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:52:09,314 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:09,331 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-10-13 12:52:09,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:52:09,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 12:52:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:09,333 INFO L225 Difference]: With dead ends: 34 [2024-10-13 12:52:09,333 INFO L226 Difference]: Without dead ends: 33 [2024-10-13 12:52:09,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:52:09,334 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 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-10-13 12:52:09,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:09,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-13 12:52:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-10-13 12:52:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 states have internal predecessors, (31), 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-10-13 12:52:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-10-13 12:52:09,342 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 7 [2024-10-13 12:52:09,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:09,342 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-13 12:52:09,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-10-13 12:52:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 12:52:09,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:09,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:09,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:52:09,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:09,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:09,345 INFO L85 PathProgramCache]: Analyzing trace with hash 205117829, now seen corresponding path program 1 times [2024-10-13 12:52:09,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:09,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50174527] [2024-10-13 12:52:09,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:09,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:09,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:52:09,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:09,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50174527] [2024-10-13 12:52:09,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50174527] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:52:09,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152565809] [2024-10-13 12:52:09,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:09,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:09,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:09,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:52:09,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 12:52:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:09,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:52:09,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:52:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:52:09,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:52:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:52:09,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152565809] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:52:09,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:52:09,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-13 12:52:09,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251203259] [2024-10-13 12:52:09,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:52:09,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:52:09,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:52:09,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:52:09,516 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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-10-13 12:52:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:09,550 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2024-10-13 12:52:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:52:09,550 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 12 [2024-10-13 12:52:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:09,551 INFO L225 Difference]: With dead ends: 63 [2024-10-13 12:52:09,551 INFO L226 Difference]: Without dead ends: 37 [2024-10-13 12:52:09,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 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-10-13 12:52:09,552 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:09,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-13 12:52:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-13 12:52:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 33 states have internal predecessors, (37), 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-10-13 12:52:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-13 12:52:09,556 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 12 [2024-10-13 12:52:09,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:09,556 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-13 12:52:09,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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-10-13 12:52:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-13 12:52:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 12:52:09,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:09,557 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:09,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 12:52:09,757 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-10-13 12:52:09,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:09,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:09,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1776268677, now seen corresponding path program 2 times [2024-10-13 12:52:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:09,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897090705] [2024-10-13 12:52:09,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 12:52:09,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:09,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897090705] [2024-10-13 12:52:09,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897090705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:09,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:09,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:52:09,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469620057] [2024-10-13 12:52:09,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:09,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:52:09,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:09,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:52:09,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:09,814 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-10-13 12:52:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:09,850 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2024-10-13 12:52:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:52:09,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 18 [2024-10-13 12:52:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:09,851 INFO L225 Difference]: With dead ends: 66 [2024-10-13 12:52:09,851 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 12:52:09,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:09,852 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:09,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 12:52:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 12:52:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.34375) internal successors, (43), 38 states have internal predecessors, (43), 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-10-13 12:52:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-10-13 12:52:09,858 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 18 [2024-10-13 12:52:09,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:09,858 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-10-13 12:52:09,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-10-13 12:52:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-10-13 12:52:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 12:52:09,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:09,859 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:09,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:52:09,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:09,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:09,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1400990656, now seen corresponding path program 1 times [2024-10-13 12:52:09,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:09,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916626214] [2024-10-13 12:52:09,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:09,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:52:09,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:09,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916626214] [2024-10-13 12:52:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916626214] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:52:09,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087099170] [2024-10-13 12:52:09,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:09,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:09,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:09,997 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:52:09,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 12:52:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:10,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:52:10,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:52:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:52:10,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:52:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:52:10,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087099170] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:52:10,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:52:10,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-10-13 12:52:10,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196379276] [2024-10-13 12:52:10,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:52:10,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 12:52:10,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:10,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 12:52:10,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-13 12:52:10,161 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 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-10-13 12:52:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:10,204 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2024-10-13 12:52:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 12:52:10,204 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 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-10-13 12:52:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:10,205 INFO L225 Difference]: With dead ends: 85 [2024-10-13 12:52:10,205 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 12:52:10,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 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-10-13 12:52:10,206 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:10,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 12:52:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 12:52:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.25) internal successors, (55), 50 states have internal predecessors, (55), 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-10-13 12:52:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2024-10-13 12:52:10,213 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 23 [2024-10-13 12:52:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:10,213 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2024-10-13 12:52:10,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 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-10-13 12:52:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2024-10-13 12:52:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 12:52:10,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:10,214 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:10,227 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-10-13 12:52:10,415 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-10-13 12:52:10,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:10,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:10,416 INFO L85 PathProgramCache]: Analyzing trace with hash -819667904, now seen corresponding path program 2 times [2024-10-13 12:52:10,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:10,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141374572] [2024-10-13 12:52:10,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:10,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:52:10,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:10,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141374572] [2024-10-13 12:52:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141374572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:52:10,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524453305] [2024-10-13 12:52:10,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:52:10,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:10,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:10,661 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:52:10,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 12:52:10,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:52:10,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:52:10,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 12:52:10,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:52:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:52:10,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:52:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:52:11,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524453305] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:52:11,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:52:11,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 33 [2024-10-13 12:52:11,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167202676] [2024-10-13 12:52:11,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:52:11,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-13 12:52:11,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:11,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-13 12:52:11,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 12:52:11,029 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 33 states have internal predecessors, (58), 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-10-13 12:52:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:11,099 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2024-10-13 12:52:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-13 12:52:11,100 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 33 states have internal predecessors, (58), 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 35 [2024-10-13 12:52:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:11,100 INFO L225 Difference]: With dead ends: 109 [2024-10-13 12:52:11,100 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 12:52:11,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 12:52:11,102 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:11,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:52:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 12:52:11,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 12:52:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.161764705882353) internal successors, (79), 74 states have internal predecessors, (79), 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-10-13 12:52:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2024-10-13 12:52:11,113 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 35 [2024-10-13 12:52:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:11,113 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2024-10-13 12:52:11,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 33 states have internal predecessors, (58), 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-10-13 12:52:11,114 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2024-10-13 12:52:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 12:52:11,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:11,116 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:11,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 12:52:11,319 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-10-13 12:52:11,320 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:11,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:11,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1460835264, now seen corresponding path program 3 times [2024-10-13 12:52:11,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:11,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193747415] [2024-10-13 12:52:11,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:11,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:52:11,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:11,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193747415] [2024-10-13 12:52:11,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193747415] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:52:11,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347042857] [2024-10-13 12:52:11,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:52:11,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:11,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:11,919 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:52:11,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 12:52:11,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 12:52:11,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:52:11,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:52:11,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:52:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-10-13 12:52:12,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:52:12,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347042857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:12,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:52:12,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [32] total 36 [2024-10-13 12:52:12,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797196957] [2024-10-13 12:52:12,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:12,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:52:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:12,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:52:12,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 12:52:12,046 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-10-13 12:52:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:12,071 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2024-10-13 12:52:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:52:12,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 59 [2024-10-13 12:52:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:12,072 INFO L225 Difference]: With dead ends: 78 [2024-10-13 12:52:12,073 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 12:52:12,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 12:52:12,075 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:12,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:12,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 12:52:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 12:52:12,083 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-10-13 12:52:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2024-10-13 12:52:12,086 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 59 [2024-10-13 12:52:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:12,087 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2024-10-13 12:52:12,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-10-13 12:52:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2024-10-13 12:52:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 12:52:12,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:12,087 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:12,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 12:52:12,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:12,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:12,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1958747123, now seen corresponding path program 1 times [2024-10-13 12:52:12,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:12,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382232629] [2024-10-13 12:52:12,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:12,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-10-13 12:52:12,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:12,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382232629] [2024-10-13 12:52:12,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382232629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:12,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:12,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:52:12,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716116340] [2024-10-13 12:52:12,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:12,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:52:12,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:12,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:52:12,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:12,356 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-10-13 12:52:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:12,374 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-10-13 12:52:12,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:52:12,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 60 [2024-10-13 12:52:12,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:12,376 INFO L225 Difference]: With dead ends: 77 [2024-10-13 12:52:12,376 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 12:52:12,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:12,376 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:12,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 12:52:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2024-10-13 12:52:12,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 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-10-13 12:52:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-10-13 12:52:12,381 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 60 [2024-10-13 12:52:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:12,381 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-10-13 12:52:12,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-10-13 12:52:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-10-13 12:52:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 12:52:12,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:12,382 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:12,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:52:12,382 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:12,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:12,383 INFO L85 PathProgramCache]: Analyzing trace with hash -530976844, now seen corresponding path program 1 times [2024-10-13 12:52:12,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:12,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495932859] [2024-10-13 12:52:12,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:12,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:12,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 12:52:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:12,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 12:52:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-10-13 12:52:12,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:12,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495932859] [2024-10-13 12:52:12,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495932859] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:52:12,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327777115] [2024-10-13 12:52:12,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:12,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:12,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:12,493 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:52:12,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 12:52:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:12,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:52:12,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:52:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-10-13 12:52:12,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:52:12,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327777115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:12,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:52:12,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-13 12:52:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201244054] [2024-10-13 12:52:12,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:12,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:52:12,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:12,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:52:12,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:52:12,590 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-13 12:52:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:12,616 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2024-10-13 12:52:12,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:52:12,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-13 12:52:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:12,617 INFO L225 Difference]: With dead ends: 74 [2024-10-13 12:52:12,617 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 12:52:12,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 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-10-13 12:52:12,618 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:12,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 12:52:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-10-13 12:52:12,626 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-10-13 12:52:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-10-13 12:52:12,627 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 72 [2024-10-13 12:52:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:12,628 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-10-13 12:52:12,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-13 12:52:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-10-13 12:52:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-13 12:52:12,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:12,629 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:12,642 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-10-13 12:52:12,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:12,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:12,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash 719587113, now seen corresponding path program 1 times [2024-10-13 12:52:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:12,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803192180] [2024-10-13 12:52:12,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:12,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:12,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 12:52:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:12,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 12:52:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-10-13 12:52:12,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:12,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803192180] [2024-10-13 12:52:12,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803192180] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:52:12,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231357653] [2024-10-13 12:52:12,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:12,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:12,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:12,938 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:52:12,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 12:52:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:13,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:52:13,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:52:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-10-13 12:52:13,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:52:13,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231357653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:13,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:52:13,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-13 12:52:13,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033075179] [2024-10-13 12:52:13,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:13,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:52:13,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:13,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:52:13,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:52:13,041 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-10-13 12:52:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:13,061 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-10-13 12:52:13,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:52:13,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-10-13 12:52:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:13,062 INFO L225 Difference]: With dead ends: 74 [2024-10-13 12:52:13,062 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 12:52:13,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 77 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-10-13 12:52:13,063 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:13,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 12:52:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-13 12:52:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.106060606060606) internal successors, (73), 69 states have internal predecessors, (73), 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-10-13 12:52:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-10-13 12:52:13,068 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 73 [2024-10-13 12:52:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:13,068 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-10-13 12:52:13,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-10-13 12:52:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-10-13 12:52:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 12:52:13,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:13,070 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:13,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 12:52:13,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:13,271 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:13,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash 832365422, now seen corresponding path program 1 times [2024-10-13 12:52:13,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:13,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814516636] [2024-10-13 12:52:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:13,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:13,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 12:52:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:13,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 12:52:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-10-13 12:52:13,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:13,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814516636] [2024-10-13 12:52:13,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814516636] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:52:13,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147951879] [2024-10-13 12:52:13,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:13,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:13,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:13,366 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:52:13,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 12:52:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:13,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 12:52:13,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:52:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 12:52:13,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:52:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 12:52:14,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147951879] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:52:14,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:52:14,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 32, 33] total 67 [2024-10-13 12:52:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345311328] [2024-10-13 12:52:14,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:52:14,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-13 12:52:14,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:14,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-13 12:52:14,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2024-10-13 12:52:14,658 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 67 states, 67 states have (on average 1.9402985074626866) internal successors, (130), 67 states have internal predecessors, (130), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 12:52:14,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:14,818 INFO L93 Difference]: Finished difference Result 154 states and 182 transitions. [2024-10-13 12:52:14,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-13 12:52:14,818 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9402985074626866) internal successors, (130), 67 states have internal predecessors, (130), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2024-10-13 12:52:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:14,820 INFO L225 Difference]: With dead ends: 154 [2024-10-13 12:52:14,820 INFO L226 Difference]: Without dead ends: 128 [2024-10-13 12:52:14,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2024-10-13 12:52:14,821 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:14,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 238 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:52:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-13 12:52:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2024-10-13 12:52:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 119 states have (on average 1.0672268907563025) internal successors, (127), 122 states have internal predecessors, (127), 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-10-13 12:52:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2024-10-13 12:52:14,835 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 74 [2024-10-13 12:52:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:14,835 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2024-10-13 12:52:14,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.9402985074626866) internal successors, (130), 67 states have internal predecessors, (130), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 12:52:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2024-10-13 12:52:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 12:52:14,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:14,839 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:14,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-13 12:52:15,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 12:52:15,044 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:15,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:15,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1259342352, now seen corresponding path program 2 times [2024-10-13 12:52:15,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:15,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752498250] [2024-10-13 12:52:15,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:15,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:15,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 12:52:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:15,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 12:52:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2024-10-13 12:52:15,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:15,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752498250] [2024-10-13 12:52:15,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752498250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:15,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:15,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:52:15,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141561029] [2024-10-13 12:52:15,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:15,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:52:15,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:15,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:52:15,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:15,175 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-10-13 12:52:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:15,198 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2024-10-13 12:52:15,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:52:15,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 132 [2024-10-13 12:52:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:15,199 INFO L225 Difference]: With dead ends: 130 [2024-10-13 12:52:15,199 INFO L226 Difference]: Without dead ends: 128 [2024-10-13 12:52:15,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:15,200 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:15,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-13 12:52:15,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-13 12:52:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 121 states have (on average 1.0661157024793388) internal successors, (129), 124 states have internal predecessors, (129), 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-10-13 12:52:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2024-10-13 12:52:15,205 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 132 [2024-10-13 12:52:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:15,205 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2024-10-13 12:52:15,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-10-13 12:52:15,205 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2024-10-13 12:52:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 12:52:15,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:15,206 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:15,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 12:52:15,207 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:15,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:15,207 INFO L85 PathProgramCache]: Analyzing trace with hash 528775861, now seen corresponding path program 1 times [2024-10-13 12:52:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:15,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696424587] [2024-10-13 12:52:15,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:15,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:15,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 12:52:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:15,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 12:52:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2024-10-13 12:52:15,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:15,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696424587] [2024-10-13 12:52:15,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696424587] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:52:15,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106659613] [2024-10-13 12:52:15,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:15,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:52:15,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:52:15,338 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:52:15,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 12:52:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:15,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-13 12:52:15,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:52:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-13 12:52:16,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:52:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-13 12:52:18,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106659613] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:52:18,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:52:18,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 64, 65] total 124 [2024-10-13 12:52:18,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864031503] [2024-10-13 12:52:18,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:52:18,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2024-10-13 12:52:18,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:18,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2024-10-13 12:52:18,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3726, Invalid=11526, Unknown=0, NotChecked=0, Total=15252 [2024-10-13 12:52:18,836 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 124 states, 124 states have (on average 1.782258064516129) internal successors, (221), 124 states have internal predecessors, (221), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 12:52:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:19,108 INFO L93 Difference]: Finished difference Result 251 states and 291 transitions. [2024-10-13 12:52:19,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2024-10-13 12:52:19,112 INFO L78 Accepts]: Start accepts. Automaton has has 124 states, 124 states have (on average 1.782258064516129) internal successors, (221), 124 states have internal predecessors, (221), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 135 [2024-10-13 12:52:19,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:19,113 INFO L225 Difference]: With dead ends: 251 [2024-10-13 12:52:19,113 INFO L226 Difference]: Without dead ends: 218 [2024-10-13 12:52:19,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 147 SyntacticMatches, 7 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4765 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3726, Invalid=11526, Unknown=0, NotChecked=0, Total=15252 [2024-10-13 12:52:19,118 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:19,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 258 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 12:52:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-13 12:52:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2024-10-13 12:52:19,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 210 states have (on average 1.0380952380952382) internal successors, (218), 213 states have internal predecessors, (218), 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-10-13 12:52:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 222 transitions. [2024-10-13 12:52:19,130 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 222 transitions. Word has length 135 [2024-10-13 12:52:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:19,130 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 222 transitions. [2024-10-13 12:52:19,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 124 states have (on average 1.782258064516129) internal successors, (221), 124 states have internal predecessors, (221), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 12:52:19,131 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 222 transitions. [2024-10-13 12:52:19,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-13 12:52:19,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:19,132 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 60, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:19,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 12:52:19,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 12:52:19,333 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:19,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash -347625496, now seen corresponding path program 1 times [2024-10-13 12:52:19,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:19,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468153538] [2024-10-13 12:52:19,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:19,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-13 12:52:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:19,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-13 12:52:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5415 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5413 trivial. 0 not checked. [2024-10-13 12:52:19,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:19,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468153538] [2024-10-13 12:52:19,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468153538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:19,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:19,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:52:19,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581987248] [2024-10-13 12:52:19,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:19,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:52:19,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:19,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:52:19,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:52:19,474 INFO L87 Difference]: Start difference. First operand 217 states and 222 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-10-13 12:52:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:19,488 INFO L93 Difference]: Finished difference Result 217 states and 222 transitions. [2024-10-13 12:52:19,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:52:19,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 223 [2024-10-13 12:52:19,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:19,489 INFO L225 Difference]: With dead ends: 217 [2024-10-13 12:52:19,489 INFO L226 Difference]: Without dead ends: 216 [2024-10-13 12:52:19,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:52:19,490 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 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-10-13 12:52:19,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-13 12:52:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-10-13 12:52:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 210 states have (on average 1.0333333333333334) internal successors, (217), 212 states have internal predecessors, (217), 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-10-13 12:52:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 221 transitions. [2024-10-13 12:52:19,497 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 221 transitions. Word has length 223 [2024-10-13 12:52:19,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:19,497 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 221 transitions. [2024-10-13 12:52:19,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-10-13 12:52:19,497 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 221 transitions. [2024-10-13 12:52:19,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-13 12:52:19,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:19,499 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 60, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:19,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 12:52:19,499 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:19,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2108512911, now seen corresponding path program 1 times [2024-10-13 12:52:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:19,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831978494] [2024-10-13 12:52:19,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:19,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:19,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-13 12:52:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:19,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-13 12:52:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5416 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5414 trivial. 0 not checked. [2024-10-13 12:52:19,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:19,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831978494] [2024-10-13 12:52:19,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831978494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:19,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:19,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:52:19,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836934593] [2024-10-13 12:52:19,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:19,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:52:19,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:19,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:52:19,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:19,634 INFO L87 Difference]: Start difference. First operand 216 states and 221 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-13 12:52:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:19,652 INFO L93 Difference]: Finished difference Result 216 states and 221 transitions. [2024-10-13 12:52:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:52:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 224 [2024-10-13 12:52:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:19,654 INFO L225 Difference]: With dead ends: 216 [2024-10-13 12:52:19,654 INFO L226 Difference]: Without dead ends: 214 [2024-10-13 12:52:19,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:19,655 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:19,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-13 12:52:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2024-10-13 12:52:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 208 states have (on average 1.0240384615384615) internal successors, (213), 208 states have internal predecessors, (213), 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-10-13 12:52:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 217 transitions. [2024-10-13 12:52:19,661 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 217 transitions. Word has length 224 [2024-10-13 12:52:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:19,661 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 217 transitions. [2024-10-13 12:52:19,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-13 12:52:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 217 transitions. [2024-10-13 12:52:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-13 12:52:19,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:52:19,663 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 60, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:19,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 12:52:19,664 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 12:52:19,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:52:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash 939390900, now seen corresponding path program 1 times [2024-10-13 12:52:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:52:19,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471254651] [2024-10-13 12:52:19,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:52:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:52:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:19,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-13 12:52:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:19,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-13 12:52:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:52:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5417 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5413 trivial. 0 not checked. [2024-10-13 12:52:19,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:52:19,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471254651] [2024-10-13 12:52:19,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471254651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:52:19,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:52:19,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:52:19,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3221274] [2024-10-13 12:52:19,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:52:19,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:52:19,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:52:19,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:52:19,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:19,829 INFO L87 Difference]: Start difference. First operand 212 states and 217 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-10-13 12:52:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:52:19,847 INFO L93 Difference]: Finished difference Result 212 states and 217 transitions. [2024-10-13 12:52:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:52:19,848 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 225 [2024-10-13 12:52:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:52:19,848 INFO L225 Difference]: With dead ends: 212 [2024-10-13 12:52:19,848 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 12:52:19,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:52:19,849 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:52:19,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:52:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 12:52:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 12:52:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:52:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 12:52:19,850 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 225 [2024-10-13 12:52:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:52:19,850 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 12:52:19,850 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-10-13 12:52:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 12:52:19,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 12:52:19,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 12:52:19,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 12:52:19,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 12:52:19,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 12:52:19,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 12:52:19,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 12:52:19,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 12:52:19,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 12:52:19,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 12:52:19,858 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:52:19,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 12:52:19,934 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:52:19,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:52:19 BoogieIcfgContainer [2024-10-13 12:52:19,947 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:52:19,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:52:19,948 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:52:19,948 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:52:19,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:52:08" (3/4) ... [2024-10-13 12:52:19,950 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 12:52:19,952 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure max [2024-10-13 12:52:19,957 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-13 12:52:19,957 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 12:52:19,958 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 12:52:19,958 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 12:52:20,032 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 12:52:20,033 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 12:52:20,033 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:52:20,033 INFO L158 Benchmark]: Toolchain (without parser) took 12251.64ms. Allocated memory was 178.3MB in the beginning and 339.7MB in the end (delta: 161.5MB). Free memory was 111.1MB in the beginning and 242.7MB in the end (delta: -131.6MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-10-13 12:52:20,034 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 178.3MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:52:20,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.21ms. Allocated memory is still 178.3MB. Free memory was 111.0MB in the beginning and 98.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 12:52:20,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.94ms. Allocated memory is still 178.3MB. Free memory was 98.7MB in the beginning and 97.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:52:20,035 INFO L158 Benchmark]: Boogie Preprocessor took 68.46ms. Allocated memory is still 178.3MB. Free memory was 97.0MB in the beginning and 150.4MB in the end (delta: -53.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 12:52:20,035 INFO L158 Benchmark]: RCFGBuilder took 300.24ms. Allocated memory is still 178.3MB. Free memory was 150.4MB in the beginning and 134.6MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 12:52:20,035 INFO L158 Benchmark]: TraceAbstraction took 11566.54ms. Allocated memory was 178.3MB in the beginning and 339.7MB in the end (delta: 161.5MB). Free memory was 134.0MB in the beginning and 247.9MB in the end (delta: -114.0MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2024-10-13 12:52:20,035 INFO L158 Benchmark]: Witness Printer took 84.84ms. Allocated memory is still 339.7MB. Free memory was 247.9MB in the beginning and 242.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 12:52:20,036 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.67ms. Allocated memory is still 178.3MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.21ms. Allocated memory is still 178.3MB. Free memory was 111.0MB in the beginning and 98.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.94ms. Allocated memory is still 178.3MB. Free memory was 98.7MB in the beginning and 97.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.46ms. Allocated memory is still 178.3MB. Free memory was 97.0MB in the beginning and 150.4MB in the end (delta: -53.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 300.24ms. Allocated memory is still 178.3MB. Free memory was 150.4MB in the beginning and 134.6MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11566.54ms. Allocated memory was 178.3MB in the beginning and 339.7MB in the end (delta: 161.5MB). Free memory was 134.0MB in the beginning and 247.9MB in the end (delta: -114.0MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * Witness Printer took 84.84ms. Allocated memory is still 339.7MB. Free memory was 247.9MB in the beginning and 242.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 38 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 17, TraceHistogramMax: 60, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 1735 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1331 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1093 IncrementalHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 404 mSDtfsCounter, 1093 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 890 GetRequests, 578 SyntacticMatches, 7 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6666 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=14, InterpolantAutomatonStates: 289, 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, 17 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1870 NumberOfCodeBlocks, 1828 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2118 ConstructedInterpolants, 0 QuantifiedInterpolants, 3138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2040 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 31 InterpolantComputations, 12 PerfectInterpolantSequences, 21694/25822 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 < (2147483649 + i)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (0 < (2147483650 + i)) RESULT: Ultimate proved your program to be correct! [2024-10-13 12:52:20,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE