./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 49a20f83cf329df91226e628147ac8e7ab93deb8d5efcb58cae512b640c9b509 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:38:11,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:38:12,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:38:12,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:38:12,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:38:12,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:38:12,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:38:12,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:38:12,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:38:12,056 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:38:12,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:38:12,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:38:12,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:38:12,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:38:12,058 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:38:12,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:38:12,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:38:12,059 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:38:12,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:38:12,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:38:12,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:38:12,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:38:12,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:38:12,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:38:12,061 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:38:12,062 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:38:12,062 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:38:12,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:38:12,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:38:12,063 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:38:12,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:38:12,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:38:12,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:38:12,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:38:12,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:38:12,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:38:12,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:38:12,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:38:12,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:38:12,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:38:12,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:38:12,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:38:12,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:38:12,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:38:12,067 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 -> 49a20f83cf329df91226e628147ac8e7ab93deb8d5efcb58cae512b640c9b509 [2024-11-09 11:38:12,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:38:12,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:38:12,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:38:12,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:38:12,332 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:38:12,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound20.c [2024-11-09 11:38:13,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:38:14,035 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:38:14,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound20.c [2024-11-09 11:38:14,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36337af47/e7f6d70ee9194f4299a821187e900ccb/FLAG71b6cc641 [2024-11-09 11:38:14,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36337af47/e7f6d70ee9194f4299a821187e900ccb [2024-11-09 11:38:14,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:38:14,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:38:14,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:38:14,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:38:14,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:38:14,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d390ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14, skipping insertion in model container [2024-11-09 11:38:14,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:38:14,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:38:14,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:38:14,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:38:14,749 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:38:14,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14 WrapperNode [2024-11-09 11:38:14,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:38:14,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:38:14,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:38:14,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:38:14,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,786 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-11-09 11:38:14,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:38:14,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:38:14,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:38:14,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:38:14,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,829 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:38:14,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:38:14,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:38:14,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:38:14,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:38:14,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14" (1/1) ... [2024-11-09 11:38:14,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:38:14,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:14,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:38:14,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:38:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:38:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:38:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:38:14,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:38:14,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:38:14,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:38:15,042 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:38:15,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:38:15,247 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-09 11:38:15,247 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:38:15,260 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:38:15,260 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:38:15,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:38:15 BoogieIcfgContainer [2024-11-09 11:38:15,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:38:15,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:38:15,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:38:15,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:38:15,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:38:14" (1/3) ... [2024-11-09 11:38:15,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c26fd4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:38:15, skipping insertion in model container [2024-11-09 11:38:15,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:14" (2/3) ... [2024-11-09 11:38:15,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c26fd4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:38:15, skipping insertion in model container [2024-11-09 11:38:15,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:38:15" (3/3) ... [2024-11-09 11:38:15,273 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound20.c [2024-11-09 11:38:15,289 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:38:15,289 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 11:38:15,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:38:15,343 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;@47b43794, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:38:15,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 11:38:15,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 11:38:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 11:38:15,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:15,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 11:38:15,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:15,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:15,359 INFO L85 PathProgramCache]: Analyzing trace with hash 889508776, now seen corresponding path program 1 times [2024-11-09 11:38:15,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:15,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53156945] [2024-11-09 11:38:15,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:15,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:15,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53156945] [2024-11-09 11:38:15,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53156945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:38:15,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:38:15,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:38:15,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302956442] [2024-11-09 11:38:15,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:38:15,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 11:38:15,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:15,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 11:38:15,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:38:15,552 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-11-09 11:38:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:15,571 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2024-11-09 11:38:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 11:38:15,573 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-11-09 11:38:15,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:15,580 INFO L225 Difference]: With dead ends: 72 [2024-11-09 11:38:15,580 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 11:38:15,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:38:15,587 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:15,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:38:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 11:38:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 11:38:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:38:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-09 11:38:15,628 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 6 [2024-11-09 11:38:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:15,628 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-09 11:38:15,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-11-09 11:38:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-09 11:38:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 11:38:15,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:15,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 11:38:15,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:38:15,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:15,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:15,631 INFO L85 PathProgramCache]: Analyzing trace with hash 889568358, now seen corresponding path program 1 times [2024-11-09 11:38:15,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:15,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069195493] [2024-11-09 11:38:15,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:15,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:15,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:15,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069195493] [2024-11-09 11:38:15,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069195493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:38:15,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:38:15,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:38:15,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522626474] [2024-11-09 11:38:15,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:38:15,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:38:15,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:15,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:38:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:38:15,739 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:15,794 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-11-09 11:38:15,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:38:15,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 11:38:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:15,795 INFO L225 Difference]: With dead ends: 34 [2024-11-09 11:38:15,795 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 11:38:15,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:38:15,797 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:15,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 79 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:38:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 11:38:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-11-09 11:38:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:38:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-11-09 11:38:15,807 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 6 [2024-11-09 11:38:15,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:15,808 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-09 11:38:15,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-11-09 11:38:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:38:15,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:15,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:15,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:38:15,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:15,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:15,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815370, now seen corresponding path program 1 times [2024-11-09 11:38:15,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:15,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470157786] [2024-11-09 11:38:15,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:15,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:15,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470157786] [2024-11-09 11:38:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470157786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:38:15,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:38:15,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:38:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230685498] [2024-11-09 11:38:15,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:38:15,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:38:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:15,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:38:15,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:38:15,899 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:15,949 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2024-11-09 11:38:15,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:38:15,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 11:38:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:15,954 INFO L225 Difference]: With dead ends: 51 [2024-11-09 11:38:15,955 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 11:38:15,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:38:15,958 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:15,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 88 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:38:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 11:38:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 11:38:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:38:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-09 11:38:15,967 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 7 [2024-11-09 11:38:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:15,968 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-09 11:38:15,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-09 11:38:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 11:38:15,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:15,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:15,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:38:15,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:15,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:15,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1510249073, now seen corresponding path program 1 times [2024-11-09 11:38:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:15,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508990320] [2024-11-09 11:38:15,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:15,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:16,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:16,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508990320] [2024-11-09 11:38:16,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508990320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:38:16,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:38:16,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:38:16,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780831943] [2024-11-09 11:38:16,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:38:16,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:38:16,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:16,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:38:16,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:38:16,106 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:16,189 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-11-09 11:38:16,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:38:16,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 11:38:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:16,191 INFO L225 Difference]: With dead ends: 32 [2024-11-09 11:38:16,191 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 11:38:16,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:38:16,192 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:16,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 73 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:38:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 11:38:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 11:38:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:38:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-09 11:38:16,199 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 11 [2024-11-09 11:38:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:16,199 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-09 11:38:16,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-09 11:38:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 11:38:16,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:16,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:16,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:38:16,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:16,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash 426919062, now seen corresponding path program 1 times [2024-11-09 11:38:16,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:16,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795453937] [2024-11-09 11:38:16,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:16,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:16,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795453937] [2024-11-09 11:38:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795453937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:38:16,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:38:16,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:38:16,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138937572] [2024-11-09 11:38:16,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:38:16,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:38:16,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:16,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:38:16,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:38:16,328 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:16,423 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-11-09 11:38:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:38:16,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-11-09 11:38:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:16,426 INFO L225 Difference]: With dead ends: 41 [2024-11-09 11:38:16,426 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 11:38:16,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:38:16,428 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:16,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:38:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 11:38:16,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-11-09 11:38:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:38:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2024-11-09 11:38:16,441 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 12 [2024-11-09 11:38:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:16,442 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-11-09 11:38:16,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2024-11-09 11:38:16,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 11:38:16,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:16,444 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:16,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:38:16,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:16,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash 426957791, now seen corresponding path program 1 times [2024-11-09 11:38:16,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:16,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269343801] [2024-11-09 11:38:16,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:16,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:16,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269343801] [2024-11-09 11:38:16,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269343801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056238100] [2024-11-09 11:38:16,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:16,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:16,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:16,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:16,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:38:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:16,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:38:16,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:16,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:16,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056238100] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:16,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:16,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-09 11:38:16,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718352735] [2024-11-09 11:38:16,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:16,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:38:16,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:16,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:38:16,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:38:16,724 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:16,871 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2024-11-09 11:38:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:38:16,872 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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 12 [2024-11-09 11:38:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:16,873 INFO L225 Difference]: With dead ends: 74 [2024-11-09 11:38:16,874 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 11:38:16,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:38:16,876 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:16,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 140 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:38:16,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 11:38:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-11-09 11:38:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 40 states have internal predecessors, (48), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:38:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-11-09 11:38:16,893 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 12 [2024-11-09 11:38:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:16,893 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-11-09 11:38:16,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-11-09 11:38:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 11:38:16,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:16,894 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:16,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:38:17,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 11:38:17,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:17,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:17,096 INFO L85 PathProgramCache]: Analyzing trace with hash 850134625, now seen corresponding path program 1 times [2024-11-09 11:38:17,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:17,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266795377] [2024-11-09 11:38:17,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:17,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:17,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:17,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266795377] [2024-11-09 11:38:17,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266795377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:17,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216952151] [2024-11-09 11:38:17,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:17,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:17,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:17,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:17,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:38:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:17,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:38:17,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:17,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:17,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216952151] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:17,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:17,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-09 11:38:17,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014753400] [2024-11-09 11:38:17,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:17,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:38:17,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:17,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:38:17,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:38:17,417 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:17,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:17,815 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2024-11-09 11:38:17,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 11:38:17,819 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 11:38:17,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:17,820 INFO L225 Difference]: With dead ends: 80 [2024-11-09 11:38:17,820 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 11:38:17,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2024-11-09 11:38:17,822 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 74 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:17,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 172 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:38:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 11:38:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2024-11-09 11:38:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 11:38:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2024-11-09 11:38:17,834 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 17 [2024-11-09 11:38:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:17,834 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2024-11-09 11:38:17,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2024-11-09 11:38:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 11:38:17,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:17,836 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2024-11-09 11:38:17,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 11:38:18,036 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,SelfDestructingSolverStorable6 [2024-11-09 11:38:18,037 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:18,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:18,037 INFO L85 PathProgramCache]: Analyzing trace with hash -924745014, now seen corresponding path program 2 times [2024-11-09 11:38:18,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:18,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216899817] [2024-11-09 11:38:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:18,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:18,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216899817] [2024-11-09 11:38:18,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216899817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:18,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321366649] [2024-11-09 11:38:18,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:38:18,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:18,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:18,213 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:18,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:38:18,256 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:38:18,256 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:38:18,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:38:18,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:18,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:18,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321366649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:18,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:18,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-11-09 11:38:18,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121931723] [2024-11-09 11:38:18,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:18,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 11:38:18,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:18,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 11:38:18,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-09 11:38:18,515 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:18,881 INFO L93 Difference]: Finished difference Result 144 states and 185 transitions. [2024-11-09 11:38:18,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 11:38:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 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 27 [2024-11-09 11:38:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:18,884 INFO L225 Difference]: With dead ends: 144 [2024-11-09 11:38:18,884 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 11:38:18,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=549, Invalid=1091, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 11:38:18,889 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 136 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:18,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 216 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:38:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 11:38:18,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2024-11-09 11:38:18,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 79 states have internal predecessors, (97), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 11:38:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2024-11-09 11:38:18,913 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 121 transitions. Word has length 27 [2024-11-09 11:38:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:18,914 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 121 transitions. [2024-11-09 11:38:18,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2024-11-09 11:38:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 11:38:18,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:18,915 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:18,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:38:19,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:19,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:19,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash -847775146, now seen corresponding path program 2 times [2024-11-09 11:38:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:19,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669055705] [2024-11-09 11:38:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:19,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:19,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669055705] [2024-11-09 11:38:19,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669055705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:19,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86647447] [2024-11-09 11:38:19,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:38:19,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:19,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:19,287 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:19,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:38:19,325 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 11:38:19,325 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:38:19,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:38:19,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-09 11:38:19,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:38:19,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86647447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:38:19,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:38:19,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 16 [2024-11-09 11:38:19,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139342747] [2024-11-09 11:38:19,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:38:19,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:38:19,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:19,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:38:19,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:38:19,371 INFO L87 Difference]: Start difference. First operand 94 states and 121 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:19,434 INFO L93 Difference]: Finished difference Result 102 states and 129 transitions. [2024-11-09 11:38:19,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:38:19,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 11:38:19,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:19,436 INFO L225 Difference]: With dead ends: 102 [2024-11-09 11:38:19,436 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 11:38:19,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-11-09 11:38:19,437 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:19,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:38:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 11:38:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2024-11-09 11:38:19,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 79 states have internal predecessors, (97), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 11:38:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2024-11-09 11:38:19,457 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 121 transitions. Word has length 32 [2024-11-09 11:38:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:19,457 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 121 transitions. [2024-11-09 11:38:19,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2024-11-09 11:38:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 11:38:19,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:19,459 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:19,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:38:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:19,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:19,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1436603759, now seen corresponding path program 1 times [2024-11-09 11:38:19,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:19,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801336901] [2024-11-09 11:38:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:19,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:19,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801336901] [2024-11-09 11:38:19,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801336901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:19,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737209933] [2024-11-09 11:38:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:19,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:19,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:19,868 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:19,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:38:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:19,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 11:38:19,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:19,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737209933] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:20,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:20,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-09 11:38:20,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058049627] [2024-11-09 11:38:20,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:20,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 11:38:20,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:20,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 11:38:20,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2024-11-09 11:38:20,227 INFO L87 Difference]: Start difference. First operand 94 states and 121 transitions. Second operand has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:20,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:20,684 INFO L93 Difference]: Finished difference Result 153 states and 192 transitions. [2024-11-09 11:38:20,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 11:38:20,684 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 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 36 [2024-11-09 11:38:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:20,686 INFO L225 Difference]: With dead ends: 153 [2024-11-09 11:38:20,686 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 11:38:20,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=779, Invalid=1573, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 11:38:20,688 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 167 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:20,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 219 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:38:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 11:38:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 105. [2024-11-09 11:38:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.1910112359550562) internal successors, (106), 90 states have internal predecessors, (106), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 11:38:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2024-11-09 11:38:20,698 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 36 [2024-11-09 11:38:20,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:20,699 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2024-11-09 11:38:20,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2024-11-09 11:38:20,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 11:38:20,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:20,701 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:20,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:38:20,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 11:38:20,906 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:20,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:20,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1674911456, now seen corresponding path program 1 times [2024-11-09 11:38:20,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:20,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906780899] [2024-11-09 11:38:20,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:20,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:21,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:38:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:21,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:38:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:21,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:38:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:21,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:38:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:21,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:38:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:38:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:38:21,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:21,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906780899] [2024-11-09 11:38:21,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906780899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:21,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90645046] [2024-11-09 11:38:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:21,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:21,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:21,192 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:21,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:38:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:21,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:38:21,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:38:21,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:38:21,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90645046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:21,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:21,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 21 [2024-11-09 11:38:21,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282777772] [2024-11-09 11:38:21,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:21,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 11:38:21,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:21,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 11:38:21,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2024-11-09 11:38:21,544 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 11:38:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:22,732 INFO L93 Difference]: Finished difference Result 172 states and 217 transitions. [2024-11-09 11:38:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 11:38:22,732 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 58 [2024-11-09 11:38:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:22,734 INFO L225 Difference]: With dead ends: 172 [2024-11-09 11:38:22,735 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 11:38:22,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=493, Invalid=1577, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 11:38:22,737 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 146 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:22,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 149 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 11:38:22,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 11:38:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 137. [2024-11-09 11:38:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.1775700934579438) internal successors, (126), 108 states have internal predecessors, (126), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 11:38:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 174 transitions. [2024-11-09 11:38:22,752 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 174 transitions. Word has length 58 [2024-11-09 11:38:22,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:22,753 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 174 transitions. [2024-11-09 11:38:22,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 11:38:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 174 transitions. [2024-11-09 11:38:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 11:38:22,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:22,755 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2024-11-09 11:38:22,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:38:22,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:22,960 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:22,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:22,960 INFO L85 PathProgramCache]: Analyzing trace with hash 27395914, now seen corresponding path program 3 times [2024-11-09 11:38:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:22,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107298732] [2024-11-09 11:38:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:23,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:23,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107298732] [2024-11-09 11:38:23,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107298732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:23,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014870726] [2024-11-09 11:38:23,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:38:23,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:23,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:23,565 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:23,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:38:23,606 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 11:38:23,606 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:38:23,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:38:23,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-09 11:38:23,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:38:23,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014870726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:38:23,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:38:23,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [26] total 30 [2024-11-09 11:38:23,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747242945] [2024-11-09 11:38:23,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:38:23,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:38:23,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:23,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:38:23,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2024-11-09 11:38:23,680 INFO L87 Difference]: Start difference. First operand 137 states and 174 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:23,738 INFO L93 Difference]: Finished difference Result 143 states and 180 transitions. [2024-11-09 11:38:23,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:38:23,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-09 11:38:23,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:23,741 INFO L225 Difference]: With dead ends: 143 [2024-11-09 11:38:23,741 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 11:38:23,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 11:38:23,743 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:23,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 101 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:38:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 11:38:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 136. [2024-11-09 11:38:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 107 states have internal predecessors, (125), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 11:38:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 173 transitions. [2024-11-09 11:38:23,761 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 173 transitions. Word has length 67 [2024-11-09 11:38:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:23,763 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 173 transitions. [2024-11-09 11:38:23,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:23,763 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2024-11-09 11:38:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 11:38:23,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:23,767 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:23,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:38:23,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:23,968 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:23,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:23,969 INFO L85 PathProgramCache]: Analyzing trace with hash -948863590, now seen corresponding path program 2 times [2024-11-09 11:38:23,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:23,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421036461] [2024-11-09 11:38:23,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:23,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:24,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:24,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421036461] [2024-11-09 11:38:24,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421036461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:24,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587876538] [2024-11-09 11:38:24,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:38:24,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:24,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:24,566 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-11-09 11:38:24,567 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-11-09 11:38:24,622 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:38:24,622 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:38:24,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 11:38:24,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:24,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:25,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587876538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:25,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:25,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 57 [2024-11-09 11:38:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008858285] [2024-11-09 11:38:25,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:25,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-09 11:38:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:25,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-09 11:38:25,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=817, Invalid=2489, Unknown=0, NotChecked=0, Total=3306 [2024-11-09 11:38:25,605 INFO L87 Difference]: Start difference. First operand 136 states and 173 transitions. Second operand has 58 states, 58 states have (on average 2.5344827586206895) internal successors, (147), 57 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:31,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:38:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:31,678 INFO L93 Difference]: Finished difference Result 373 states and 471 transitions. [2024-11-09 11:38:31,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-09 11:38:31,679 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.5344827586206895) internal successors, (147), 57 states have internal predecessors, (147), 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 71 [2024-11-09 11:38:31,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:31,682 INFO L225 Difference]: With dead ends: 373 [2024-11-09 11:38:31,683 INFO L226 Difference]: Without dead ends: 356 [2024-11-09 11:38:31,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4913 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4572, Invalid=14334, Unknown=0, NotChecked=0, Total=18906 [2024-11-09 11:38:31,691 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 581 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:31,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 287 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-11-09 11:38:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-09 11:38:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 206. [2024-11-09 11:38:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 177 states have (on average 1.2542372881355932) internal successors, (222), 177 states have internal predecessors, (222), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 11:38:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 270 transitions. [2024-11-09 11:38:31,709 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 270 transitions. Word has length 71 [2024-11-09 11:38:31,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:31,710 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 270 transitions. [2024-11-09 11:38:31,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.5344827586206895) internal successors, (147), 57 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2024-11-09 11:38:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 11:38:31,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:31,713 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:31,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 11:38:31,913 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,SelfDestructingSolverStorable12 [2024-11-09 11:38:31,914 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:31,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash -289877419, now seen corresponding path program 2 times [2024-11-09 11:38:31,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:31,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764902195] [2024-11-09 11:38:31,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:31,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:32,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:38:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:32,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:38:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:32,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:38:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:32,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:38:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:32,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:38:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:32,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:38:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:32,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 11:38:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:32,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:38:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:32,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 11:38:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:32,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 11:38:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 11:38:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 11:38:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 11:38:32,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:32,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764902195] [2024-11-09 11:38:32,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764902195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:32,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223418932] [2024-11-09 11:38:32,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:38:32,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:32,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:32,372 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-11-09 11:38:32,373 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-11-09 11:38:32,441 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:38:32,441 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:38:32,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 11:38:32,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 11:38:32,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 11:38:32,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223418932] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:32,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:32,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 29 [2024-11-09 11:38:32,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469738745] [2024-11-09 11:38:32,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:32,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 11:38:32,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:32,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 11:38:32,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2024-11-09 11:38:32,972 INFO L87 Difference]: Start difference. First operand 206 states and 270 transitions. Second operand has 30 states, 29 states have (on average 3.0) internal successors, (87), 30 states have internal predecessors, (87), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-09 11:38:37,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 11:38:41,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 11:38:45,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 11:38:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:46,459 INFO L93 Difference]: Finished difference Result 343 states and 452 transitions. [2024-11-09 11:38:46,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-09 11:38:46,460 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.0) internal successors, (87), 30 states have internal predecessors, (87), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 99 [2024-11-09 11:38:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:46,462 INFO L225 Difference]: With dead ends: 343 [2024-11-09 11:38:46,462 INFO L226 Difference]: Without dead ends: 342 [2024-11-09 11:38:46,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=932, Invalid=3100, Unknown=0, NotChecked=0, Total=4032 [2024-11-09 11:38:46,465 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 161 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:46,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 401 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 334 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2024-11-09 11:38:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-09 11:38:46,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 238. [2024-11-09 11:38:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 195 states have (on average 1.241025641025641) internal successors, (242), 195 states have internal predecessors, (242), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 11:38:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 314 transitions. [2024-11-09 11:38:46,493 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 314 transitions. Word has length 99 [2024-11-09 11:38:46,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:46,493 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 314 transitions. [2024-11-09 11:38:46,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.0) internal successors, (87), 30 states have internal predecessors, (87), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-09 11:38:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 314 transitions. [2024-11-09 11:38:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 11:38:46,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:46,497 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 13, 13, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:46,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 11:38:46,701 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-11-09 11:38:46,702 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:46,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:46,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1054100441, now seen corresponding path program 1 times [2024-11-09 11:38:46,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:46,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813194786] [2024-11-09 11:38:46,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:47,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 11:38:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:47,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 11:38:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:47,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 11:38:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:47,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:38:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:47,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 11:38:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 11:38:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-09 11:38:47,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:47,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813194786] [2024-11-09 11:38:47,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813194786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:47,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134599570] [2024-11-09 11:38:47,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:47,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:47,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:47,546 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:47,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 11:38:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:47,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 11:38:47,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:47,765 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-09 11:38:47,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-09 11:38:48,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134599570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:48,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:48,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 30] total 42 [2024-11-09 11:38:48,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100860662] [2024-11-09 11:38:48,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:48,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 11:38:48,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:48,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 11:38:48,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 11:38:48,460 INFO L87 Difference]: Start difference. First operand 238 states and 314 transitions. Second operand has 42 states, 42 states have (on average 2.9047619047619047) internal successors, (122), 42 states have internal predecessors, (122), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 11:38:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:49,722 INFO L93 Difference]: Finished difference Result 312 states and 394 transitions. [2024-11-09 11:38:49,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-09 11:38:49,723 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.9047619047619047) internal successors, (122), 42 states have internal predecessors, (122), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-11-09 11:38:49,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:49,726 INFO L225 Difference]: With dead ends: 312 [2024-11-09 11:38:49,726 INFO L226 Difference]: Without dead ends: 292 [2024-11-09 11:38:49,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 207 SyntacticMatches, 16 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2099, Invalid=4381, Unknown=0, NotChecked=0, Total=6480 [2024-11-09 11:38:49,731 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 309 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:49,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 234 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:38:49,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-09 11:38:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 238. [2024-11-09 11:38:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 195 states have (on average 1.205128205128205) internal successors, (235), 195 states have internal predecessors, (235), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 11:38:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2024-11-09 11:38:49,752 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 112 [2024-11-09 11:38:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:49,753 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2024-11-09 11:38:49,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.9047619047619047) internal successors, (122), 42 states have internal predecessors, (122), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 11:38:49,753 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2024-11-09 11:38:49,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 11:38:49,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:49,755 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:49,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 11:38:49,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 11:38:49,956 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:49,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash -264304885, now seen corresponding path program 3 times [2024-11-09 11:38:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:49,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702717437] [2024-11-09 11:38:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:49,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:50,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 11:38:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:50,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 11:38:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 11:38:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:50,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 11:38:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:50,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 11:38:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:50,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 11:38:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 11:38:50,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:50,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702717437] [2024-11-09 11:38:50,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702717437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:50,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886804745] [2024-11-09 11:38:50,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:38:50,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:50,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:50,820 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:50,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 11:38:50,870 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 11:38:50,870 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:38:50,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:38:50,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2024-11-09 11:38:51,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2024-11-09 11:38:51,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886804745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:51,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:51,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 6, 6] total 43 [2024-11-09 11:38:51,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071964067] [2024-11-09 11:38:51,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:51,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 11:38:51,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:51,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 11:38:51,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 11:38:51,314 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 44 states have internal predecessors, (122), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-09 11:38:54,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:38:54,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:54,122 INFO L93 Difference]: Finished difference Result 409 states and 530 transitions. [2024-11-09 11:38:54,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-11-09 11:38:54,122 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 44 states have internal predecessors, (122), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 113 [2024-11-09 11:38:54,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:54,124 INFO L225 Difference]: With dead ends: 409 [2024-11-09 11:38:54,124 INFO L226 Difference]: Without dead ends: 408 [2024-11-09 11:38:54,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2210, Invalid=7296, Unknown=0, NotChecked=0, Total=9506 [2024-11-09 11:38:54,127 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 428 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:54,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 268 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 11:38:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-09 11:38:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 238. [2024-11-09 11:38:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 195 states have (on average 1.205128205128205) internal successors, (235), 195 states have internal predecessors, (235), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 11:38:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2024-11-09 11:38:54,159 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 113 [2024-11-09 11:38:54,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:54,160 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2024-11-09 11:38:54,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 44 states have internal predecessors, (122), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-09 11:38:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2024-11-09 11:38:54,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 11:38:54,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:54,162 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 20, 20, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:54,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 11:38:54,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 11:38:54,367 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:54,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:54,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1638386812, now seen corresponding path program 2 times [2024-11-09 11:38:54,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:54,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38955926] [2024-11-09 11:38:54,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:54,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:54,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 11:38:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:54,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 11:38:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:54,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 11:38:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 11:38:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:54,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 11:38:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:54,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 11:38:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2024-11-09 11:38:54,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38955926] [2024-11-09 11:38:54,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38955926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:38:54,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:38:54,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:38:54,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233222524] [2024-11-09 11:38:54,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:38:54,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:38:54,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:54,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:38:54,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:38:54,505 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 11:38:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:54,563 INFO L93 Difference]: Finished difference Result 263 states and 338 transitions. [2024-11-09 11:38:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:38:54,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 147 [2024-11-09 11:38:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:54,567 INFO L225 Difference]: With dead ends: 263 [2024-11-09 11:38:54,567 INFO L226 Difference]: Without dead ends: 242 [2024-11-09 11:38:54,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:38:54,568 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:54,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 108 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:38:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-09 11:38:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2024-11-09 11:38:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 198 states have (on average 1.1717171717171717) internal successors, (232), 198 states have internal predecessors, (232), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 11:38:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 304 transitions. [2024-11-09 11:38:54,589 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 304 transitions. Word has length 147 [2024-11-09 11:38:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:54,590 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 304 transitions. [2024-11-09 11:38:54,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 11:38:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 304 transitions. [2024-11-09 11:38:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 11:38:54,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:54,592 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:54,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 11:38:54,592 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:54,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:54,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1291316870, now seen corresponding path program 3 times [2024-11-09 11:38:54,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:54,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591818471] [2024-11-09 11:38:54,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:54,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 153 proven. 1 refuted. 0 times theorem prover too weak. 1575 trivial. 0 not checked. [2024-11-09 11:38:54,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:54,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591818471] [2024-11-09 11:38:54,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591818471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:54,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549174772] [2024-11-09 11:38:54,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:38:54,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:54,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:54,770 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:54,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 11:38:54,815 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 11:38:54,815 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:38:54,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:38:54,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:54,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 153 proven. 1 refuted. 0 times theorem prover too weak. 1575 trivial. 0 not checked. [2024-11-09 11:38:54,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 153 proven. 1 refuted. 0 times theorem prover too weak. 1575 trivial. 0 not checked. [2024-11-09 11:38:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549174772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:54,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:54,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-09 11:38:54,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579292019] [2024-11-09 11:38:54,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:54,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:38:54,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:54,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:38:54,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:38:54,933 INFO L87 Difference]: Start difference. First operand 241 states and 304 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:55,420 INFO L93 Difference]: Finished difference Result 261 states and 329 transitions. [2024-11-09 11:38:55,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 11:38:55,420 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2024-11-09 11:38:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:55,422 INFO L225 Difference]: With dead ends: 261 [2024-11-09 11:38:55,422 INFO L226 Difference]: Without dead ends: 257 [2024-11-09 11:38:55,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:38:55,423 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 61 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:55,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 177 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:38:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-09 11:38:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 179. [2024-11-09 11:38:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.161764705882353) internal successors, (158), 136 states have internal predecessors, (158), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 11:38:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 230 transitions. [2024-11-09 11:38:55,441 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 230 transitions. Word has length 141 [2024-11-09 11:38:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:55,441 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 230 transitions. [2024-11-09 11:38:55,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 230 transitions. [2024-11-09 11:38:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-09 11:38:55,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:55,444 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:55,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 11:38:55,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 11:38:55,647 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:55,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:55,647 INFO L85 PathProgramCache]: Analyzing trace with hash -899172846, now seen corresponding path program 1 times [2024-11-09 11:38:55,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:55,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989350039] [2024-11-09 11:38:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:55,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:38:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:38:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:38:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:38:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:38:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:38:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:38:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 11:38:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 11:38:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 11:38:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:38:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 11:38:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 11:38:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 11:38:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 11:38:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 11:38:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 11:38:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 11:38:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 11:38:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-09 11:38:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 11:38:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-09 11:38:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-09 11:38:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-09 11:38:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-09 11:38:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-09 11:38:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-09 11:38:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-09 11:38:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-09 11:38:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-09 11:38:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-09 11:38:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-09 11:38:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-09 11:38:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-09 11:38:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-09 11:38:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-09 11:38:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2718 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-09 11:38:56,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:56,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989350039] [2024-11-09 11:38:56,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989350039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:56,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890295220] [2024-11-09 11:38:56,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:56,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:56,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:56,358 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:56,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 11:38:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 11:38:56,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2718 backedges. 0 proven. 2358 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-09 11:38:56,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2718 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-09 11:38:57,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890295220] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:57,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:57,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 33 [2024-11-09 11:38:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014309423] [2024-11-09 11:38:57,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:57,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 11:38:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:57,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 11:38:57,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 11:38:57,326 INFO L87 Difference]: Start difference. First operand 179 states and 230 transitions. Second operand has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 34 states have internal predecessors, (117), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) [2024-11-09 11:39:01,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 11:39:02,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 11:39:04,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:39:09,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:39:13,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:39:17,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 11:39:17,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:17,565 INFO L93 Difference]: Finished difference Result 474 states and 640 transitions. [2024-11-09 11:39:17,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-09 11:39:17,566 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 34 states have internal predecessors, (117), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) Word has length 228 [2024-11-09 11:39:17,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:17,569 INFO L225 Difference]: With dead ends: 474 [2024-11-09 11:39:17,570 INFO L226 Difference]: Without dead ends: 473 [2024-11-09 11:39:17,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1218, Invalid=3072, Unknown=0, NotChecked=0, Total=4290 [2024-11-09 11:39:17,572 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 292 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 80 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:17,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 299 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 391 Invalid, 4 Unknown, 0 Unchecked, 19.6s Time] [2024-11-09 11:39:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-09 11:39:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 307. [2024-11-09 11:39:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 208 states have (on average 1.1442307692307692) internal successors, (238), 208 states have internal predecessors, (238), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-09 11:39:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 406 transitions. [2024-11-09 11:39:17,613 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 406 transitions. Word has length 228 [2024-11-09 11:39:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:17,614 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 406 transitions. [2024-11-09 11:39:17,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 34 states have internal predecessors, (117), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) [2024-11-09 11:39:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 406 transitions. [2024-11-09 11:39:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 11:39:17,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:17,618 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:17,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 11:39:17,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:17,819 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:17,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash -474186510, now seen corresponding path program 4 times [2024-11-09 11:39:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:17,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974747196] [2024-11-09 11:39:17,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:17,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:39:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:39:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:39:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:39:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:39:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:39:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 11:39:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 11:39:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:39:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 11:39:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 11:39:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 11:39:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 11:39:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 11:39:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 11:39:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 11:39:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 11:39:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 11:39:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 11:39:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-09 11:39:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-09 11:39:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-09 11:39:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 11:39:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 11:39:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-09 11:39:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-09 11:39:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-09 11:39:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-09 11:39:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-09 11:39:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-09 11:39:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-09 11:39:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-09 11:39:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-09 11:39:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-09 11:39:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-09 11:39:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-09 11:39:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2733 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-09 11:39:18,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:18,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974747196] [2024-11-09 11:39:18,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974747196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:18,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60674752] [2024-11-09 11:39:18,613 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 11:39:18,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:18,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:18,615 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:18,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 11:39:18,751 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 11:39:18,751 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:39:18,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 11:39:18,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2733 backedges. 1413 proven. 468 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2024-11-09 11:39:19,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2733 backedges. 117 proven. 36 refuted. 0 times theorem prover too weak. 2580 trivial. 0 not checked. [2024-11-09 11:39:19,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60674752] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:19,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:19,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8, 8] total 35 [2024-11-09 11:39:19,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900767718] [2024-11-09 11:39:19,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:19,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 11:39:19,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:19,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 11:39:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=975, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 11:39:19,461 INFO L87 Difference]: Start difference. First operand 307 states and 406 transitions. Second operand has 36 states, 35 states have (on average 3.5428571428571427) internal successors, (124), 36 states have internal predecessors, (124), 13 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 13 states have call predecessors, (78), 13 states have call successors, (78) [2024-11-09 11:39:23,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:39:27,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:39:31,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:39:36,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 11:39:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:36,610 INFO L93 Difference]: Finished difference Result 514 states and 686 transitions. [2024-11-09 11:39:36,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 11:39:36,610 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.5428571428571427) internal successors, (124), 36 states have internal predecessors, (124), 13 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 13 states have call predecessors, (78), 13 states have call successors, (78) Word has length 238 [2024-11-09 11:39:36,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:36,612 INFO L225 Difference]: With dead ends: 514 [2024-11-09 11:39:36,612 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:39:36,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1016, Invalid=2644, Unknown=0, NotChecked=0, Total=3660 [2024-11-09 11:39:36,615 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 247 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 55 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:36,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 205 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 277 Invalid, 4 Unknown, 0 Unchecked, 16.6s Time] [2024-11-09 11:39:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:39:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:39:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:39:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:39:36,616 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 238 [2024-11-09 11:39:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:36,617 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:39:36,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.5428571428571427) internal successors, (124), 36 states have internal predecessors, (124), 13 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 13 states have call predecessors, (78), 13 states have call successors, (78) [2024-11-09 11:39:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:39:36,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:39:36,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 11:39:36,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 11:39:36,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 11:39:36,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 11:39:36,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 11:39:36,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:36,825 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:36,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.