./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pr5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pr5.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 374c198ea90130277bd1a124bc94571dd240bc0803e6f3936a68065c719ddd5a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:07:44,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:07:44,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:07:44,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:07:44,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:07:44,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:07:44,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:07:44,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:07:44,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:07:44,734 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:07:44,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:07:44,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:07:44,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:07:44,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:07:44,736 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:07:44,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:07:44,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:07:44,739 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:07:44,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:07:44,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:07:44,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:07:44,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:07:44,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:07:44,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:07:44,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:07:44,746 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:07:44,747 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:07:44,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:07:44,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:07:44,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:07:44,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:07:44,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:07:44,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:07:44,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:07:44,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:07:44,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:07:44,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:07:44,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:07:44,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:07:44,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:07:44,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:07:44,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:07:44,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:07:44,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:07:44,754 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-clean/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-clean/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 -> 374c198ea90130277bd1a124bc94571dd240bc0803e6f3936a68065c719ddd5a [2024-10-11 20:07:45,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:07:45,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:07:45,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:07:45,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:07:45,132 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:07:45,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pr5.c [2024-10-11 20:07:46,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:07:46,622 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:07:46,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pr5.c [2024-10-11 20:07:46,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0128c651f/1273aa88b6664a4da5a4297a8e6ea4c8/FLAG02aa96561 [2024-10-11 20:07:46,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0128c651f/1273aa88b6664a4da5a4297a8e6ea4c8 [2024-10-11 20:07:46,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:07:46,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:07:46,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:07:46,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:07:46,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:07:46,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf982c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46, skipping insertion in model container [2024-10-11 20:07:46,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:07:46,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:07:46,808 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:07:46,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:07:46,847 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:07:46,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46 WrapperNode [2024-10-11 20:07:46,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:07:46,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:07:46,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:07:46,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:07:46,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,880 INFO L138 Inliner]: procedures = 15, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-10-11 20:07:46,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:07:46,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:07:46,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:07:46,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:07:46,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,902 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 6, 12]. 60 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 10 writes are split as follows [0, 0, 10]. [2024-10-11 20:07:46,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:07:46,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:07:46,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:07:46,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:07:46,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46" (1/1) ... [2024-10-11 20:07:46,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:07:46,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:46,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:07:46,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:07:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:07:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:07:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:07:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 20:07:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:07:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:07:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:07:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 20:07:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:07:47,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:07:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:07:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:07:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 20:07:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:07:47,135 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:07:47,139 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:07:47,605 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2024-10-11 20:07:47,606 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:07:47,648 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:07:47,652 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:07:47,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:07:47 BoogieIcfgContainer [2024-10-11 20:07:47,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:07:47,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:07:47,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:07:47,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:07:47,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:07:46" (1/3) ... [2024-10-11 20:07:47,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28293b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:07:47, skipping insertion in model container [2024-10-11 20:07:47,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:07:46" (2/3) ... [2024-10-11 20:07:47,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28293b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:07:47, skipping insertion in model container [2024-10-11 20:07:47,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:07:47" (3/3) ... [2024-10-11 20:07:47,668 INFO L112 eAbstractionObserver]: Analyzing ICFG pr5.c [2024-10-11 20:07:47,681 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:07:47,681 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-10-11 20:07:47,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:07:47,759 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;@5c98e53a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:07:47,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-10-11 20:07:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 113 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:07:47,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:47,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:07:47,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:47,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:47,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2114817910, now seen corresponding path program 1 times [2024-10-11 20:07:47,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:47,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037395607] [2024-10-11 20:07:47,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:47,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:48,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:48,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037395607] [2024-10-11 20:07:48,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037395607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:48,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:48,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:07:48,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129213283] [2024-10-11 20:07:48,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:48,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:07:48,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:48,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:07:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:07:48,055 INFO L87 Difference]: Start difference. First operand has 114 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 113 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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-10-11 20:07:48,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:48,100 INFO L93 Difference]: Finished difference Result 224 states and 247 transitions. [2024-10-11 20:07:48,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:07:48,106 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-10-11 20:07:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:48,116 INFO L225 Difference]: With dead ends: 224 [2024-10-11 20:07:48,121 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 20:07:48,123 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-10-11 20:07:48,131 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:48,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:48,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 20:07:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 20:07:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 64 states have (on average 1.828125) internal successors, (117), 109 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2024-10-11 20:07:48,197 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 6 [2024-10-11 20:07:48,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:48,198 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2024-10-11 20:07:48,198 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-10-11 20:07:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2024-10-11 20:07:48,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:07:48,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:48,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:07:48,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:07:48,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:48,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2114815988, now seen corresponding path program 1 times [2024-10-11 20:07:48,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:48,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112189874] [2024-10-11 20:07:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:48,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:48,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112189874] [2024-10-11 20:07:48,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112189874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:48,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:48,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:48,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134916466] [2024-10-11 20:07:48,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:48,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:48,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:48,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:48,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:48,635 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:48,689 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2024-10-11 20:07:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:48,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 20:07:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:48,691 INFO L225 Difference]: With dead ends: 110 [2024-10-11 20:07:48,692 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 20:07:48,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:48,694 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:48,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 107 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 20:07:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 20:07:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 64 states have (on average 1.8125) internal successors, (116), 108 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2024-10-11 20:07:48,711 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 6 [2024-10-11 20:07:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:48,712 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2024-10-11 20:07:48,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2024-10-11 20:07:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:07:48,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:48,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:48,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:07:48,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:48,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1134786134, now seen corresponding path program 1 times [2024-10-11 20:07:48,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:48,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505615783] [2024-10-11 20:07:48,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:48,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:48,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:48,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505615783] [2024-10-11 20:07:48,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505615783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:48,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:48,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:48,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72862588] [2024-10-11 20:07:48,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:48,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:48,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:48,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:48,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:07:48,999 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:49,057 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2024-10-11 20:07:49,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:49,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:07:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:49,061 INFO L225 Difference]: With dead ends: 109 [2024-10-11 20:07:49,061 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 20:07:49,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:07:49,062 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:49,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 106 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 20:07:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-11 20:07:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 64 states have (on average 1.796875) internal successors, (115), 107 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2024-10-11 20:07:49,082 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 7 [2024-10-11 20:07:49,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:49,082 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2024-10-11 20:07:49,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:49,083 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2024-10-11 20:07:49,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:07:49,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:49,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:49,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:07:49,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:49,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:49,090 INFO L85 PathProgramCache]: Analyzing trace with hash -726072493, now seen corresponding path program 1 times [2024-10-11 20:07:49,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:49,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823541307] [2024-10-11 20:07:49,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:49,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:49,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:49,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823541307] [2024-10-11 20:07:49,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823541307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:49,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:49,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:07:49,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453805723] [2024-10-11 20:07:49,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:49,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:07:49,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:49,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:07:49,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:07:49,157 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:49,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:49,349 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2024-10-11 20:07:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:07:49,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 20:07:49,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:49,350 INFO L225 Difference]: With dead ends: 197 [2024-10-11 20:07:49,350 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 20:07:49,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:07:49,351 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 49 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:49,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 93 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 20:07:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2024-10-11 20:07:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 155 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2024-10-11 20:07:49,359 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 10 [2024-10-11 20:07:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:49,360 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2024-10-11 20:07:49,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2024-10-11 20:07:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:07:49,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:49,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:49,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:07:49,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:49,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash -424596703, now seen corresponding path program 1 times [2024-10-11 20:07:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:49,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793818356] [2024-10-11 20:07:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793818356] [2024-10-11 20:07:49,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793818356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:49,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:49,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899134385] [2024-10-11 20:07:49,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:49,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:49,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:49,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:49,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:49,426 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:49,522 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2024-10-11 20:07:49,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:49,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 20:07:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:49,525 INFO L225 Difference]: With dead ends: 165 [2024-10-11 20:07:49,525 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 20:07:49,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:49,527 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:49,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 238 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 20:07:49,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-11 20:07:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 162 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2024-10-11 20:07:49,536 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 15 [2024-10-11 20:07:49,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:49,537 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2024-10-11 20:07:49,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:49,537 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2024-10-11 20:07:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:07:49,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:49,538 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:49,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:07:49,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:49,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:49,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1138725807, now seen corresponding path program 1 times [2024-10-11 20:07:49,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:49,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581495553] [2024-10-11 20:07:49,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:49,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:07:49,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:49,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581495553] [2024-10-11 20:07:49,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581495553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:49,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:49,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:07:49,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939300093] [2024-10-11 20:07:49,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:49,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:49,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:49,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:07:49,726 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:49,859 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2024-10-11 20:07:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:49,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 22 [2024-10-11 20:07:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:49,860 INFO L225 Difference]: With dead ends: 181 [2024-10-11 20:07:49,860 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 20:07:49,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:07:49,865 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 213 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:49,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 86 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 20:07:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2024-10-11 20:07:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 162 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2024-10-11 20:07:49,888 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 22 [2024-10-11 20:07:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:49,888 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2024-10-11 20:07:49,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2024-10-11 20:07:49,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:07:49,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:49,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:49,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:07:49,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:49,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:49,889 INFO L85 PathProgramCache]: Analyzing trace with hash -662322167, now seen corresponding path program 1 times [2024-10-11 20:07:49,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:49,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093300464] [2024-10-11 20:07:49,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:49,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:49,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:49,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093300464] [2024-10-11 20:07:49,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093300464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:49,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:49,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:49,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392618213] [2024-10-11 20:07:49,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:49,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:49,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:49,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:49,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:49,959 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:50,081 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2024-10-11 20:07:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:50,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2024-10-11 20:07:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:50,082 INFO L225 Difference]: With dead ends: 168 [2024-10-11 20:07:50,082 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 20:07:50,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:50,083 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 26 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:50,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 158 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 20:07:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-11 20:07:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 122 states have (on average 1.4672131147540983) internal successors, (179), 165 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2024-10-11 20:07:50,088 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 35 [2024-10-11 20:07:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:50,088 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2024-10-11 20:07:50,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2024-10-11 20:07:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 20:07:50,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:50,090 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:50,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:07:50,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:50,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:50,090 INFO L85 PathProgramCache]: Analyzing trace with hash -300135210, now seen corresponding path program 1 times [2024-10-11 20:07:50,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:50,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428487287] [2024-10-11 20:07:50,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:50,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:50,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:50,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428487287] [2024-10-11 20:07:50,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428487287] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:50,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457190518] [2024-10-11 20:07:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:50,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:50,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:50,148 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:50,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:07:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:50,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:50,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:50,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:50,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457190518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:50,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:50,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-11 20:07:50,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106706391] [2024-10-11 20:07:50,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:50,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:50,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:50,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:50,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:50,268 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:50,303 INFO L93 Difference]: Finished difference Result 439 states and 475 transitions. [2024-10-11 20:07:50,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:50,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-10-11 20:07:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:50,305 INFO L225 Difference]: With dead ends: 439 [2024-10-11 20:07:50,305 INFO L226 Difference]: Without dead ends: 295 [2024-10-11 20:07:50,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:07:50,306 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 287 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:50,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 199 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-11 20:07:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 244. [2024-10-11 20:07:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 200 states have (on average 1.495) internal successors, (299), 243 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 299 transitions. [2024-10-11 20:07:50,312 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 299 transitions. Word has length 41 [2024-10-11 20:07:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:50,312 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 299 transitions. [2024-10-11 20:07:50,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 299 transitions. [2024-10-11 20:07:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 20:07:50,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:50,313 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:50,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:07:50,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:50,515 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:50,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash 878151072, now seen corresponding path program 1 times [2024-10-11 20:07:50,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:50,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225521251] [2024-10-11 20:07:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:50,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:50,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225521251] [2024-10-11 20:07:50,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225521251] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:50,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611857600] [2024-10-11 20:07:50,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:50,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:50,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:50,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:50,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:07:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:50,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:50,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:50,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:50,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611857600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:50,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:50,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-11 20:07:50,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866004790] [2024-10-11 20:07:50,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:50,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:50,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:50,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:50,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:50,736 INFO L87 Difference]: Start difference. First operand 244 states and 299 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:50,783 INFO L93 Difference]: Finished difference Result 410 states and 442 transitions. [2024-10-11 20:07:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:50,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-10-11 20:07:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:50,785 INFO L225 Difference]: With dead ends: 410 [2024-10-11 20:07:50,785 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 20:07:50,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:07:50,787 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 264 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:50,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 200 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 20:07:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 236. [2024-10-11 20:07:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 192 states have (on average 1.484375) internal successors, (285), 235 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2024-10-11 20:07:50,794 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 41 [2024-10-11 20:07:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:50,795 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2024-10-11 20:07:50,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2024-10-11 20:07:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 20:07:50,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:50,797 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:50,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:07:50,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:50,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:51,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:51,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2050651798, now seen corresponding path program 1 times [2024-10-11 20:07:51,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:51,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799531192] [2024-10-11 20:07:51,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:51,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:51,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:51,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799531192] [2024-10-11 20:07:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799531192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:51,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681757194] [2024-10-11 20:07:51,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:51,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:51,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:51,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:51,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:07:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:51,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:51,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:51,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:51,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681757194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:51,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:51,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 20:07:51,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293810708] [2024-10-11 20:07:51,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:51,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:07:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:51,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:07:51,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:51,147 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:51,299 INFO L93 Difference]: Finished difference Result 236 states and 285 transitions. [2024-10-11 20:07:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:07:51,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 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 41 [2024-10-11 20:07:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:51,300 INFO L225 Difference]: With dead ends: 236 [2024-10-11 20:07:51,300 INFO L226 Difference]: Without dead ends: 215 [2024-10-11 20:07:51,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:07:51,301 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 74 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:51,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 96 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:51,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-11 20:07:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-10-11 20:07:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 192 states have (on average 1.296875) internal successors, (249), 214 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 249 transitions. [2024-10-11 20:07:51,305 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 249 transitions. Word has length 41 [2024-10-11 20:07:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:51,308 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 249 transitions. [2024-10-11 20:07:51,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 249 transitions. [2024-10-11 20:07:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 20:07:51,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:51,309 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:51,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:07:51,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:51,510 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:51,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:51,511 INFO L85 PathProgramCache]: Analyzing trace with hash -854303636, now seen corresponding path program 1 times [2024-10-11 20:07:51,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:51,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402843036] [2024-10-11 20:07:51,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:51,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:51,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:51,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402843036] [2024-10-11 20:07:51,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402843036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:51,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692555474] [2024-10-11 20:07:51,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:51,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:51,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:51,560 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:51,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:07:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:51,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:51,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:51,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:07:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692555474] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:51,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:51,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 20:07:51,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989232234] [2024-10-11 20:07:51,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:51,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:07:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:51,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:07:51,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:07:51,700 INFO L87 Difference]: Start difference. First operand 215 states and 249 transitions. Second operand has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:51,912 INFO L93 Difference]: Finished difference Result 322 states and 406 transitions. [2024-10-11 20:07:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:07:51,912 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 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 42 [2024-10-11 20:07:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:51,913 INFO L225 Difference]: With dead ends: 322 [2024-10-11 20:07:51,913 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 20:07:51,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:07:51,914 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 181 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:51,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 169 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 20:07:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-10-11 20:07:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 296 states have (on average 1.135135135135135) internal successors, (336), 300 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 336 transitions. [2024-10-11 20:07:51,919 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 336 transitions. Word has length 42 [2024-10-11 20:07:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:51,919 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 336 transitions. [2024-10-11 20:07:51,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 336 transitions. [2024-10-11 20:07:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 20:07:51,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:51,921 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:51,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:07:52,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:07:52,125 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:52,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:52,125 INFO L85 PathProgramCache]: Analyzing trace with hash -132695438, now seen corresponding path program 1 times [2024-10-11 20:07:52,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:52,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001580089] [2024-10-11 20:07:52,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:52,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:52,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:52,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:52,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001580089] [2024-10-11 20:07:52,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001580089] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:52,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928497295] [2024-10-11 20:07:52,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:52,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:52,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:52,258 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:52,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:07:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:52,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:07:52,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:52,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:07:52,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928497295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:52,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:07:52,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:07:52,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717180099] [2024-10-11 20:07:52,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:52,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:07:52,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:52,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:07:52,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:07:52,376 INFO L87 Difference]: Start difference. First operand 301 states and 336 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:52,558 INFO L93 Difference]: Finished difference Result 301 states and 336 transitions. [2024-10-11 20:07:52,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:07:52,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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 53 [2024-10-11 20:07:52,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:52,560 INFO L225 Difference]: With dead ends: 301 [2024-10-11 20:07:52,560 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 20:07:52,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:07:52,561 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 109 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:52,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 77 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 20:07:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-10-11 20:07:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 296 states have (on average 1.1317567567567568) internal successors, (335), 299 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 335 transitions. [2024-10-11 20:07:52,576 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 335 transitions. Word has length 53 [2024-10-11 20:07:52,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:52,576 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 335 transitions. [2024-10-11 20:07:52,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 335 transitions. [2024-10-11 20:07:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 20:07:52,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:52,581 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:52,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:07:52,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 20:07:52,782 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:52,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:52,783 INFO L85 PathProgramCache]: Analyzing trace with hash 181408928, now seen corresponding path program 1 times [2024-10-11 20:07:52,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:52,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060772728] [2024-10-11 20:07:52,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:52,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:52,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:52,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060772728] [2024-10-11 20:07:52,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060772728] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:52,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963373355] [2024-10-11 20:07:52,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:52,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:52,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:52,924 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:52,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:07:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:53,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:07:53,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:53,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:53,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963373355] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:53,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:07:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578195995] [2024-10-11 20:07:53,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:53,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:07:53,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:53,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:07:53,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:07:53,125 INFO L87 Difference]: Start difference. First operand 300 states and 335 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:53,401 INFO L93 Difference]: Finished difference Result 322 states and 362 transitions. [2024-10-11 20:07:53,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:07:53,401 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 20:07:53,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:53,402 INFO L225 Difference]: With dead ends: 322 [2024-10-11 20:07:53,402 INFO L226 Difference]: Without dead ends: 321 [2024-10-11 20:07:53,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:07:53,403 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 101 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:53,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 189 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:07:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-11 20:07:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-10-11 20:07:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 317 states have (on average 1.1324921135646688) internal successors, (359), 320 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 359 transitions. [2024-10-11 20:07:53,416 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 359 transitions. Word has length 54 [2024-10-11 20:07:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:53,417 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 359 transitions. [2024-10-11 20:07:53,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 359 transitions. [2024-10-11 20:07:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 20:07:53,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:53,417 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:53,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:07:53,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:07:53,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:53,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1761684524, now seen corresponding path program 2 times [2024-10-11 20:07:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:53,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300477252] [2024-10-11 20:07:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:07:53,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:53,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300477252] [2024-10-11 20:07:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300477252] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:53,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166377706] [2024-10-11 20:07:53,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:07:53,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:53,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:53,914 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:53,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:07:53,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:07:53,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:07:53,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:53,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-11 20:07:54,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-11 20:07:54,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166377706] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:54,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:54,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 3, 3] total 14 [2024-10-11 20:07:54,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298047114] [2024-10-11 20:07:54,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:54,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:07:54,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:54,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:07:54,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:07:54,232 INFO L87 Difference]: Start difference. First operand 321 states and 359 transitions. Second operand has 15 states, 14 states have (on average 8.928571428571429) internal successors, (125), 15 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:54,544 INFO L93 Difference]: Finished difference Result 329 states and 369 transitions. [2024-10-11 20:07:54,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 20:07:54,545 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.928571428571429) internal successors, (125), 15 states have internal predecessors, (125), 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 75 [2024-10-11 20:07:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:54,546 INFO L225 Difference]: With dead ends: 329 [2024-10-11 20:07:54,546 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 20:07:54,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-10-11 20:07:54,547 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 226 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:54,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 127 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:07:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 20:07:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-11 20:07:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 281 states have (on average 1.106761565836299) internal successors, (311), 283 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 311 transitions. [2024-10-11 20:07:54,551 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 311 transitions. Word has length 75 [2024-10-11 20:07:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:54,551 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 311 transitions. [2024-10-11 20:07:54,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.928571428571429) internal successors, (125), 15 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 311 transitions. [2024-10-11 20:07:54,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 20:07:54,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:54,552 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:54,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:07:54,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:54,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:54,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:54,757 INFO L85 PathProgramCache]: Analyzing trace with hash -891319387, now seen corresponding path program 1 times [2024-10-11 20:07:54,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:54,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053219274] [2024-10-11 20:07:54,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:54,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-11 20:07:54,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:54,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053219274] [2024-10-11 20:07:54,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053219274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:07:54,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:07:54,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:07:54,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241487456] [2024-10-11 20:07:54,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:07:54,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:07:54,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:54,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:07:54,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:54,809 INFO L87 Difference]: Start difference. First operand 284 states and 311 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:54,865 INFO L93 Difference]: Finished difference Result 284 states and 311 transitions. [2024-10-11 20:07:54,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:07:54,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 98 [2024-10-11 20:07:54,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:54,867 INFO L225 Difference]: With dead ends: 284 [2024-10-11 20:07:54,867 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 20:07:54,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:07:54,867 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:54,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:07:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 20:07:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-10-11 20:07:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 281 states have (on average 1.099644128113879) internal successors, (309), 282 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 309 transitions. [2024-10-11 20:07:54,871 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 309 transitions. Word has length 98 [2024-10-11 20:07:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:54,872 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 309 transitions. [2024-10-11 20:07:54,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 309 transitions. [2024-10-11 20:07:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 20:07:54,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:07:54,872 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:54,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 20:07:54,873 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2024-10-11 20:07:54,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:07:54,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1577071628, now seen corresponding path program 2 times [2024-10-11 20:07:54,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:07:54,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163924134] [2024-10-11 20:07:54,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:07:54,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:07:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:07:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-11 20:07:55,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:07:55,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163924134] [2024-10-11 20:07:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163924134] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:07:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559064186] [2024-10-11 20:07:55,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:07:55,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:07:55,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:07:55,103 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:07:55,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:07:55,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:07:55,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:07:55,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:07:55,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:07:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-11 20:07:55,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:07:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-11 20:07:55,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559064186] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:07:55,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:07:55,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2024-10-11 20:07:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712515628] [2024-10-11 20:07:55,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:07:55,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:07:55,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:07:55,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:07:55,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:07:55,582 INFO L87 Difference]: Start difference. First operand 283 states and 309 transitions. Second operand has 9 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:07:55,643 INFO L93 Difference]: Finished difference Result 283 states and 309 transitions. [2024-10-11 20:07:55,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:07:55,644 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-11 20:07:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:07:55,644 INFO L225 Difference]: With dead ends: 283 [2024-10-11 20:07:55,644 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:07:55,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:07:55,645 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 100 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:07:55,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 16 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:07:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:07:55,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:07:55,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:07:55,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2024-10-11 20:07:55,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:07:55,646 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:07:55,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:07:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:07:55,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:07:55,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 46 remaining) [2024-10-11 20:07:55,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 46 remaining) [2024-10-11 20:07:55,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 46 remaining) [2024-10-11 20:07:55,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 46 remaining) [2024-10-11 20:07:55,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 46 remaining) [2024-10-11 20:07:55,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 46 remaining) [2024-10-11 20:07:55,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 46 remaining) [2024-10-11 20:07:55,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 46 remaining) [2024-10-11 20:07:55,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 46 remaining) [2024-10-11 20:07:55,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 46 remaining) [2024-10-11 20:07:55,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 46 remaining) [2024-10-11 20:07:55,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 46 remaining) [2024-10-11 20:07:55,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 46 remaining) [2024-10-11 20:07:55,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 46 remaining) [2024-10-11 20:07:55,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:07:55,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 20:07:55,859 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:07:55,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:07:56,030 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:07:56,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:07:56 BoogieIcfgContainer [2024-10-11 20:07:56,050 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:07:56,051 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:07:56,051 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:07:56,051 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:07:56,051 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:07:47" (3/4) ... [2024-10-11 20:07:56,053 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:07:56,060 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-11 20:07:56,061 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 20:07:56,061 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:07:56,061 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:07:56,140 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:07:56,143 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:07:56,143 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:07:56,143 INFO L158 Benchmark]: Toolchain (without parser) took 9498.67ms. Allocated memory was 155.2MB in the beginning and 255.9MB in the end (delta: 100.7MB). Free memory was 84.9MB in the beginning and 172.2MB in the end (delta: -87.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-10-11 20:07:56,144 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 155.2MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:07:56,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.93ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 71.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:07:56,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.44ms. Allocated memory is still 155.2MB. Free memory was 71.9MB in the beginning and 69.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:07:56,144 INFO L158 Benchmark]: Boogie Preprocessor took 39.41ms. Allocated memory is still 155.2MB. Free memory was 69.9MB in the beginning and 67.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:07:56,145 INFO L158 Benchmark]: RCFGBuilder took 731.30ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 67.6MB in the beginning and 170.6MB in the end (delta: -103.0MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2024-10-11 20:07:56,145 INFO L158 Benchmark]: TraceAbstraction took 8392.25ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 170.0MB in the beginning and 178.5MB in the end (delta: -8.5MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2024-10-11 20:07:56,145 INFO L158 Benchmark]: Witness Printer took 92.34ms. Allocated memory is still 255.9MB. Free memory was 178.5MB in the beginning and 172.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 20:07:56,147 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.82ms. Allocated memory is still 155.2MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.93ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 71.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.44ms. Allocated memory is still 155.2MB. Free memory was 71.9MB in the beginning and 69.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.41ms. Allocated memory is still 155.2MB. Free memory was 69.9MB in the beginning and 67.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 731.30ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 67.6MB in the beginning and 170.6MB in the end (delta: -103.0MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8392.25ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 170.0MB in the beginning and 178.5MB in the end (delta: -8.5MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. * Witness Printer took 92.34ms. Allocated memory is still 255.9MB. Free memory was 178.5MB in the beginning and 172.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 114 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2106 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2106 mSDsluCounter, 2023 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 989 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2435 IncrementalHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 1034 mSDtfsCounter, 2435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 708 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred in iteration=13, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 100 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1101 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1348 ConstructedInterpolants, 0 QuantifiedInterpolants, 4845 SizeOfPredicates, 10 NumberOfNonLiveVariables, 990 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 542/747 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 46 specifications checked. All of them hold - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: ((((((((1 <= i) && (2 <= CELLCOUNT)) && (7 <= CCCELVOL3)) && (CELLCOUNT == (5 * ((CELLCOUNT >= 0) ? (CELLCOUNT / 5) : ((CELLCOUNT / 5) - 1))))) && (CELLCOUNT <= 2147483647)) && (CCCELVOL5 <= 2)) && (5 <= CCCELVOL4)) || (((((((i == 0) && (2 <= CELLCOUNT)) && (7 <= CCCELVOL3)) && (CELLCOUNT == (5 * ((CELLCOUNT >= 0) ? (CELLCOUNT / 5) : ((CELLCOUNT / 5) - 1))))) && (CELLCOUNT <= 2147483647)) && (CCCELVOL5 <= 2)) && (5 <= CCCELVOL4))) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((2 <= CELLCOUNT) && (7 <= CCCELVOL3)) && (CELLCOUNT == (5 * ((CELLCOUNT >= 0) ? (CELLCOUNT / 5) : ((CELLCOUNT / 5) - 1))))) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (CCCELVOL5 <= 2)) && (5 <= CCCELVOL4)) || (((((((2 <= CELLCOUNT) && (i == 1)) && (7 <= CCCELVOL3)) && (CELLCOUNT == (5 * ((CELLCOUNT >= 0) ? (CELLCOUNT / 5) : ((CELLCOUNT / 5) - 1))))) && (CELLCOUNT <= 2147483647)) && (CCCELVOL5 <= 2)) && (5 <= CCCELVOL4))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:07:56,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE