./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/verifythis/elimination_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/elimination_max.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 11:15:34,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 11:15:34,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 11:15:34,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 11:15:34,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 11:15:34,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 11:15:34,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 11:15:34,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 11:15:34,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 11:15:34,630 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 11:15:34,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 11:15:34,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 11:15:34,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 11:15:34,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 11:15:34,634 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 11:15:34,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 11:15:34,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 11:15:34,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 11:15:34,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 11:15:34,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 11:15:34,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 11:15:34,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 11:15:34,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 11:15:34,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 11:15:34,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 11:15:34,641 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 11:15:34,641 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 11:15:34,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 11:15:34,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 11:15:34,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 11:15:34,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 11:15:34,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 11:15:34,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 11:15:34,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 11:15:34,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:15:34,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 11:15:34,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 11:15:34,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 11:15:34,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 11:15:34,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 11:15:34,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 11:15:34,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 11:15:34,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 11:15:34,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 11:15:34,648 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e [2024-11-19 11:15:34,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 11:15:34,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 11:15:34,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 11:15:34,935 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 11:15:34,935 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 11:15:34,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max.c [2024-11-19 11:15:36,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 11:15:36,615 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 11:15:36,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max.c [2024-11-19 11:15:36,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48a9ee1c/1d28f69f03ba42d8a6dca236c726407a/FLAG7cb2e8adb [2024-11-19 11:15:36,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48a9ee1c/1d28f69f03ba42d8a6dca236c726407a [2024-11-19 11:15:36,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 11:15:36,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 11:15:36,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 11:15:36,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 11:15:36,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 11:15:36,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:36,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eeb0023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36, skipping insertion in model container [2024-11-19 11:15:36,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:36,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 11:15:36,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:15:36,910 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 11:15:36,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:15:36,956 INFO L204 MainTranslator]: Completed translation [2024-11-19 11:15:36,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36 WrapperNode [2024-11-19 11:15:36,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 11:15:36,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 11:15:36,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 11:15:36,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 11:15:36,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:36,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:36,996 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-11-19 11:15:36,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 11:15:36,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 11:15:36,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 11:15:36,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 11:15:37,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:37,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:37,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:37,035 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-19 11:15:37,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:37,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:37,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:37,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:37,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:37,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:37,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 11:15:37,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 11:15:37,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 11:15:37,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 11:15:37,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36" (1/1) ... [2024-11-19 11:15:37,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:15:37,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:37,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 11:15:37,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 11:15:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 11:15:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 11:15:37,174 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 11:15:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 11:15:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 11:15:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 11:15:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 11:15:37,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 11:15:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 11:15:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 11:15:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 11:15:37,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 11:15:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 11:15:37,243 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 11:15:37,245 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 11:15:37,415 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-19 11:15:37,415 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 11:15:37,432 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 11:15:37,433 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 11:15:37,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:15:37 BoogieIcfgContainer [2024-11-19 11:15:37,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 11:15:37,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 11:15:37,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 11:15:37,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 11:15:37,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:15:36" (1/3) ... [2024-11-19 11:15:37,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc64e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:15:37, skipping insertion in model container [2024-11-19 11:15:37,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:36" (2/3) ... [2024-11-19 11:15:37,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc64e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:15:37, skipping insertion in model container [2024-11-19 11:15:37,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:15:37" (3/3) ... [2024-11-19 11:15:37,440 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2024-11-19 11:15:37,453 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 11:15:37,454 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-19 11:15:37,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 11:15:37,512 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;@37a4731f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 11:15:37,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 11:15:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.5) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 11:15:37,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:37,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:37,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:37,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:37,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1376423430, now seen corresponding path program 1 times [2024-11-19 11:15:37,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:37,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131396342] [2024-11-19 11:15:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:37,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:37,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131396342] [2024-11-19 11:15:37,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131396342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:37,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:37,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 11:15:37,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692079601] [2024-11-19 11:15:37,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:37,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 11:15:37,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:37,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 11:15:37,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 11:15:37,777 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.5) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:37,806 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2024-11-19 11:15:37,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 11:15:37,809 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-19 11:15:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:37,817 INFO L225 Difference]: With dead ends: 86 [2024-11-19 11:15:37,817 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 11:15:37,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 11:15:37,828 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:37,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:37,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 11:15:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 11:15:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-19 11:15:37,876 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 10 [2024-11-19 11:15:37,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:37,876 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-19 11:15:37,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-19 11:15:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 11:15:37,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:37,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:37,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 11:15:37,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:37,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:37,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1433681732, now seen corresponding path program 1 times [2024-11-19 11:15:37,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:37,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865146206] [2024-11-19 11:15:37,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:37,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:38,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:38,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865146206] [2024-11-19 11:15:38,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865146206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:38,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:38,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 11:15:38,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804183452] [2024-11-19 11:15:38,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:38,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:15:38,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:38,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:15:38,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:15:38,234 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:38,292 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-19 11:15:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:38,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-19 11:15:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:38,294 INFO L225 Difference]: With dead ends: 40 [2024-11-19 11:15:38,294 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 11:15:38,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:15:38,296 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 24 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:38,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 108 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 11:15:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 11:15:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 31 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:38,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-19 11:15:38,304 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 10 [2024-11-19 11:15:38,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:38,306 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-19 11:15:38,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-19 11:15:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 11:15:38,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:38,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:38,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 11:15:38,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:38,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:38,308 INFO L85 PathProgramCache]: Analyzing trace with hash -150082929, now seen corresponding path program 1 times [2024-11-19 11:15:38,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:38,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264999906] [2024-11-19 11:15:38,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:38,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:38,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:38,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264999906] [2024-11-19 11:15:38,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264999906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:38,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:38,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:15:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993771001] [2024-11-19 11:15:38,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:38,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:38,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:38,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:38,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:38,457 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:38,528 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2024-11-19 11:15:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:38,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 11:15:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:38,530 INFO L225 Difference]: With dead ends: 61 [2024-11-19 11:15:38,530 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 11:15:38,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:38,532 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 17 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:38,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 119 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:15:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 11:15:38,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2024-11-19 11:15:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.375) internal successors, (44), 37 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-11-19 11:15:38,557 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 14 [2024-11-19 11:15:38,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:38,558 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-19 11:15:38,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:38,558 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-11-19 11:15:38,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 11:15:38,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:38,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:38,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 11:15:38,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:38,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash -150082737, now seen corresponding path program 1 times [2024-11-19 11:15:38,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:38,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430681248] [2024-11-19 11:15:38,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:38,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:38,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:38,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430681248] [2024-11-19 11:15:38,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430681248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:38,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:38,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 11:15:38,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384367281] [2024-11-19 11:15:38,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:38,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:15:38,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:38,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:15:38,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:15:38,821 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:38,899 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2024-11-19 11:15:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:38,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 11:15:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:38,901 INFO L225 Difference]: With dead ends: 75 [2024-11-19 11:15:38,901 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 11:15:38,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:15:38,904 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 34 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:38,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 96 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:15:38,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 11:15:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 11:15:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 31 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-19 11:15:38,912 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 14 [2024-11-19 11:15:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:38,912 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-19 11:15:38,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-19 11:15:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 11:15:38,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:38,913 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:38,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 11:15:38,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:38,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:38,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1845346742, now seen corresponding path program 1 times [2024-11-19 11:15:38,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:38,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875905836] [2024-11-19 11:15:38,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:38,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:39,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:39,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875905836] [2024-11-19 11:15:39,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875905836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:39,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950084952] [2024-11-19 11:15:39,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:39,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:39,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:39,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:39,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 11:15:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:39,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:15:39,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:39,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:39,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950084952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:39,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:39,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-19 11:15:39,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322262541] [2024-11-19 11:15:39,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:39,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:15:39,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:39,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:15:39,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:39,210 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:39,284 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-11-19 11:15:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:15:39,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-19 11:15:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:39,286 INFO L225 Difference]: With dead ends: 51 [2024-11-19 11:15:39,286 INFO L226 Difference]: Without dead ends: 50 [2024-11-19 11:15:39,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:39,287 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:39,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 143 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:15:39,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-19 11:15:39,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2024-11-19 11:15:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-19 11:15:39,300 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2024-11-19 11:15:39,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:39,300 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-19 11:15:39,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-19 11:15:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 11:15:39,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:39,304 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:39,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 11:15:39,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:39,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:39,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:39,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1371174098, now seen corresponding path program 1 times [2024-11-19 11:15:39,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:39,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899422339] [2024-11-19 11:15:39,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:39,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:39,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:39,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899422339] [2024-11-19 11:15:39,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899422339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:39,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760264026] [2024-11-19 11:15:39,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:39,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:39,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:39,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:39,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 11:15:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:39,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:15:39,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:39,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:15:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:39,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760264026] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 11:15:39,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 11:15:39,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-19 11:15:39,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856350926] [2024-11-19 11:15:39,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 11:15:39,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 11:15:39,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:39,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 11:15:39,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-19 11:15:39,791 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:39,901 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2024-11-19 11:15:39,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 11:15:39,902 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-19 11:15:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:39,904 INFO L225 Difference]: With dead ends: 102 [2024-11-19 11:15:39,905 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 11:15:39,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-19 11:15:39,906 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:39,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 195 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:15:39,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 11:15:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 49. [2024-11-19 11:15:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-11-19 11:15:39,924 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 19 [2024-11-19 11:15:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:39,924 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-11-19 11:15:39,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-11-19 11:15:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 11:15:39,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:39,926 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 11:15:39,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 11:15:40,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 11:15:40,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:40,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:40,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1344681024, now seen corresponding path program 1 times [2024-11-19 11:15:40,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:40,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402771811] [2024-11-19 11:15:40,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:40,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 11:15:40,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:40,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402771811] [2024-11-19 11:15:40,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402771811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:40,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:40,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:15:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856397316] [2024-11-19 11:15:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:40,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:40,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:40,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:40,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:40,200 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 11:15:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:40,226 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2024-11-19 11:15:40,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:40,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-19 11:15:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:40,229 INFO L225 Difference]: With dead ends: 57 [2024-11-19 11:15:40,229 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 11:15:40,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:40,230 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:40,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:40,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 11:15:40,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-19 11:15:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 47 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 11:15:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2024-11-19 11:15:40,238 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2024-11-19 11:15:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:40,239 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2024-11-19 11:15:40,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 11:15:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-11-19 11:15:40,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 11:15:40,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:40,240 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:40,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 11:15:40,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:40,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:40,241 INFO L85 PathProgramCache]: Analyzing trace with hash 485676829, now seen corresponding path program 2 times [2024-11-19 11:15:40,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:40,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133137320] [2024-11-19 11:15:40,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 11:15:40,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:40,256 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 11:15:40,258 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 11:15:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 11:15:40,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:40,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133137320] [2024-11-19 11:15:40,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133137320] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:40,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652423217] [2024-11-19 11:15:40,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 11:15:40,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:40,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:40,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:40,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 11:15:40,365 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 11:15:40,365 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 11:15:40,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:15:40,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 11:15:40,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:15:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 11:15:40,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652423217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 11:15:40,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 11:15:40,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-19 11:15:40,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963775882] [2024-11-19 11:15:40,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 11:15:40,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 11:15:40,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:40,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 11:15:40,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:15:40,509 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 11:15:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:40,630 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2024-11-19 11:15:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 11:15:40,630 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-19 11:15:40,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:40,631 INFO L225 Difference]: With dead ends: 74 [2024-11-19 11:15:40,634 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 11:15:40,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-19 11:15:40,636 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 43 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:40,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 243 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:15:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 11:15:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 38. [2024-11-19 11:15:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 11:15:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-19 11:15:40,646 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 31 [2024-11-19 11:15:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:40,646 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-19 11:15:40,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 11:15:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-19 11:15:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 11:15:40,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:40,648 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-19 11:15:40,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 11:15:40,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:40,849 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:40,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:40,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1600492123, now seen corresponding path program 1 times [2024-11-19 11:15:40,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:40,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640293371] [2024-11-19 11:15:40,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:40,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:40,994 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 11:15:40,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:40,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640293371] [2024-11-19 11:15:40,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640293371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:40,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237470940] [2024-11-19 11:15:40,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:40,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:40,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:40,997 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:40,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 11:15:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:41,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 11:15:41,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 11:15:41,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:41,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237470940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:41,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:41,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2024-11-19 11:15:41,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744258281] [2024-11-19 11:15:41,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:41,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 11:15:41,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:41,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 11:15:41,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-19 11:15:41,226 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 11:15:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:41,339 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-19 11:15:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 11:15:41,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2024-11-19 11:15:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:41,341 INFO L225 Difference]: With dead ends: 64 [2024-11-19 11:15:41,341 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 11:15:41,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-11-19 11:15:41,342 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:41,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:15:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 11:15:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-19 11:15:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 11:15:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-19 11:15:41,351 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 44 [2024-11-19 11:15:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:41,352 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-19 11:15:41,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 11:15:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-19 11:15:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 11:15:41,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:41,353 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-19 11:15:41,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 11:15:41,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:41,554 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:41,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:41,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1468385312, now seen corresponding path program 1 times [2024-11-19 11:15:41,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:41,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529014495] [2024-11-19 11:15:41,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:41,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 11:15:41,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:41,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529014495] [2024-11-19 11:15:41,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529014495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:41,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782926252] [2024-11-19 11:15:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:41,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:41,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:41,661 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:41,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 11:15:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:41,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:15:41,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 11:15:41,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:41,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782926252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:41,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:41,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-19 11:15:41,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398895050] [2024-11-19 11:15:41,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:41,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:15:41,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:41,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:15:41,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:41,783 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 11:15:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:41,815 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-19 11:15:41,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:15:41,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2024-11-19 11:15:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:41,816 INFO L225 Difference]: With dead ends: 39 [2024-11-19 11:15:41,817 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 11:15:41,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:41,818 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:41,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 11:15:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 11:15:41,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 11:15:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-19 11:15:41,830 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 48 [2024-11-19 11:15:41,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:41,831 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-19 11:15:41,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 11:15:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-19 11:15:41,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 11:15:41,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:41,836 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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] [2024-11-19 11:15:41,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 11:15:42,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 11:15:42,037 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:42,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1724695497, now seen corresponding path program 1 times [2024-11-19 11:15:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:42,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495508399] [2024-11-19 11:15:42,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:42,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 11:15:42,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:42,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495508399] [2024-11-19 11:15:42,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495508399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:42,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088700653] [2024-11-19 11:15:42,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:42,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:42,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:42,124 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:42,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 11:15:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:42,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:15:42,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 11:15:42,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:15:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 11:15:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088700653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 11:15:42,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 11:15:42,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-19 11:15:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359529780] [2024-11-19 11:15:42,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 11:15:42,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 11:15:42,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:42,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 11:15:42,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-19 11:15:42,289 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-19 11:15:42,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:42,344 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-11-19 11:15:42,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 11:15:42,344 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 49 [2024-11-19 11:15:42,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:42,345 INFO L225 Difference]: With dead ends: 57 [2024-11-19 11:15:42,345 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 11:15:42,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 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-11-19 11:15:42,346 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:42,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:42,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 11:15:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-19 11:15:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 11:15:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-11-19 11:15:42,361 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 49 [2024-11-19 11:15:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:42,362 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-11-19 11:15:42,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-19 11:15:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-11-19 11:15:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 11:15:42,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:42,364 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:42,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 11:15:42,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:42,565 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:42,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:42,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1839834280, now seen corresponding path program 2 times [2024-11-19 11:15:42,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:42,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535920375] [2024-11-19 11:15:42,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 11:15:42,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:42,587 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 11:15:42,587 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 11:15:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-19 11:15:42,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:42,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535920375] [2024-11-19 11:15:42,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535920375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:42,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950688490] [2024-11-19 11:15:42,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 11:15:42,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:42,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:42,738 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:42,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 11:15:42,809 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 11:15:42,810 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 11:15:42,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 11:15:42,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 80 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-19 11:15:43,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:15:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-19 11:15:43,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950688490] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 11:15:43,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 11:15:43,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 26 [2024-11-19 11:15:43,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885824793] [2024-11-19 11:15:43,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 11:15:43,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 11:15:43,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:43,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 11:15:43,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2024-11-19 11:15:43,242 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 8 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-19 11:15:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:43,466 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2024-11-19 11:15:43,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 11:15:43,466 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 8 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 79 [2024-11-19 11:15:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:43,467 INFO L225 Difference]: With dead ends: 101 [2024-11-19 11:15:43,467 INFO L226 Difference]: Without dead ends: 61 [2024-11-19 11:15:43,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2024-11-19 11:15:43,469 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:43,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 323 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:15:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-19 11:15:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-11-19 11:15:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 11:15:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-11-19 11:15:43,485 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 79 [2024-11-19 11:15:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:43,485 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-11-19 11:15:43,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 8 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-19 11:15:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-11-19 11:15:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 11:15:43,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:43,488 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:43,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 11:15:43,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:43,689 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:43,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash -888135603, now seen corresponding path program 3 times [2024-11-19 11:15:43,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:43,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235104513] [2024-11-19 11:15:43,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 11:15:43,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:43,707 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 11:15:43,708 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 11:15:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-19 11:15:43,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:43,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235104513] [2024-11-19 11:15:43,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235104513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:43,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112404910] [2024-11-19 11:15:43,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 11:15:43,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:43,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:43,801 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:43,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 11:15:43,867 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 11:15:43,867 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 11:15:43,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 11:15:43,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-19 11:15:43,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:15:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-19 11:15:44,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112404910] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 11:15:44,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 11:15:44,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-19 11:15:44,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385686124] [2024-11-19 11:15:44,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 11:15:44,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 11:15:44,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:44,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 11:15:44,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:15:44,095 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-19 11:15:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:44,172 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2024-11-19 11:15:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 11:15:44,172 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 83 [2024-11-19 11:15:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:44,173 INFO L225 Difference]: With dead ends: 60 [2024-11-19 11:15:44,173 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 11:15:44,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-19 11:15:44,174 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:44,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 11:15:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 11:15:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 11:15:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 11:15:44,175 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2024-11-19 11:15:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:44,175 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 11:15:44,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-19 11:15:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 11:15:44,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 11:15:44,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-19 11:15:44,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-19 11:15:44,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-19 11:15:44,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-19 11:15:44,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-19 11:15:44,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-19 11:15:44,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-19 11:15:44,180 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-19 11:15:44,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 11:15:44,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 11:15:44,388 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:44,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 11:15:45,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 11:15:45,333 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:102) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:105) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:57) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createInvariantResults(FloydHoareUtils.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-19 11:15:45,339 INFO L158 Benchmark]: Toolchain (without parser) took 8688.76ms. Allocated memory was 182.5MB in the beginning and 281.0MB in the end (delta: 98.6MB). Free memory was 114.8MB in the beginning and 143.0MB in the end (delta: -28.2MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. [2024-11-19 11:15:45,339 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 104.9MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:15:45,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.87ms. Allocated memory is still 182.5MB. Free memory was 114.6MB in the beginning and 155.2MB in the end (delta: -40.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-19 11:15:45,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.76ms. Allocated memory is still 182.5MB. Free memory was 155.2MB in the beginning and 153.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:15:45,340 INFO L158 Benchmark]: Boogie Preprocessor took 58.96ms. Allocated memory is still 182.5MB. Free memory was 153.8MB in the beginning and 151.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 11:15:45,340 INFO L158 Benchmark]: RCFGBuilder took 376.18ms. Allocated memory is still 182.5MB. Free memory was 151.7MB in the beginning and 137.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 11:15:45,341 INFO L158 Benchmark]: TraceAbstraction took 7903.35ms. Allocated memory was 182.5MB in the beginning and 281.0MB in the end (delta: 98.6MB). Free memory was 137.0MB in the beginning and 143.0MB in the end (delta: -6.0MB). Peak memory consumption was 115.4MB. Max. memory is 16.1GB. [2024-11-19 11:15:45,346 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34ms. Allocated memory is still 104.9MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.87ms. Allocated memory is still 182.5MB. Free memory was 114.6MB in the beginning and 155.2MB in the end (delta: -40.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.76ms. Allocated memory is still 182.5MB. Free memory was 155.2MB in the beginning and 153.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.96ms. Allocated memory is still 182.5MB. Free memory was 153.8MB in the beginning and 151.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.18ms. Allocated memory is still 182.5MB. Free memory was 151.7MB in the beginning and 137.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7903.35ms. Allocated memory was 182.5MB in the beginning and 281.0MB in the end (delta: 98.6MB). Free memory was 137.0MB in the beginning and 143.0MB in the end (delta: -6.0MB). Peak memory consumption was 115.4MB. 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: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: 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 3 procedures, 45 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 1855 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1402 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 782 IncrementalHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 453 mSDtfsCounter, 782 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 701 GetRequests, 585 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=12, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 117 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 824 NumberOfCodeBlocks, 702 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1059 ConstructedInterpolants, 0 QuantifiedInterpolants, 2322 SizeOfPredicates, 12 NumberOfNonLiveVariables, 997 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 905/1066 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-19 11:15:45,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/elimination_max.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 11:15:47,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 11:15:47,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-11-19 11:15:47,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 11:15:47,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 11:15:47,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 11:15:47,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 11:15:47,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 11:15:47,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 11:15:47,906 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 11:15:47,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 11:15:47,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 11:15:47,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 11:15:47,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 11:15:47,908 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 11:15:47,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 11:15:47,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 11:15:47,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 11:15:47,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 11:15:47,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 11:15:47,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 11:15:47,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 11:15:47,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 11:15:47,915 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 11:15:47,915 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 11:15:47,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 11:15:47,915 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 11:15:47,916 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 11:15:47,916 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 11:15:47,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 11:15:47,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 11:15:47,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 11:15:47,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 11:15:47,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 11:15:47,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 11:15:47,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 11:15:47,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:15:47,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 11:15:47,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 11:15:47,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 11:15:47,922 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 11:15:47,923 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 11:15:47,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 11:15:47,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 11:15:47,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 11:15:47,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 11:15:47,925 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e [2024-11-19 11:15:48,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 11:15:48,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 11:15:48,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 11:15:48,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 11:15:48,287 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 11:15:48,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max.c [2024-11-19 11:15:49,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 11:15:50,091 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 11:15:50,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max.c [2024-11-19 11:15:50,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3444bd6/b2181c745e774b6ea3215f46546fe014/FLAG09fe653cf [2024-11-19 11:15:50,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3444bd6/b2181c745e774b6ea3215f46546fe014 [2024-11-19 11:15:50,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 11:15:50,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 11:15:50,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 11:15:50,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 11:15:50,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 11:15:50,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156c9034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50, skipping insertion in model container [2024-11-19 11:15:50,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 11:15:50,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:15:50,761 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 11:15:50,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:15:50,814 INFO L204 MainTranslator]: Completed translation [2024-11-19 11:15:50,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50 WrapperNode [2024-11-19 11:15:50,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 11:15:50,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 11:15:50,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 11:15:50,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 11:15:50,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,864 INFO L138 Inliner]: procedures = 20, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-11-19 11:15:50,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 11:15:50,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 11:15:50,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 11:15:50,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 11:15:50,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,900 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-19 11:15:50,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 11:15:50,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 11:15:50,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 11:15:50,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 11:15:50,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50" (1/1) ... [2024-11-19 11:15:50,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:15:50,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:50,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 11:15:50,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 11:15:51,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 11:15:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 11:15:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 11:15:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 11:15:51,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 11:15:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 11:15:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 11:15:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 11:15:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 11:15:51,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 11:15:51,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 11:15:51,034 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 11:15:51,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 11:15:51,131 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 11:15:51,134 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 11:15:51,386 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-19 11:15:51,387 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 11:15:51,402 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 11:15:51,402 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 11:15:51,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:15:51 BoogieIcfgContainer [2024-11-19 11:15:51,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 11:15:51,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 11:15:51,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 11:15:51,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 11:15:51,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:15:50" (1/3) ... [2024-11-19 11:15:51,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3b736f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:15:51, skipping insertion in model container [2024-11-19 11:15:51,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:50" (2/3) ... [2024-11-19 11:15:51,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3b736f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:15:51, skipping insertion in model container [2024-11-19 11:15:51,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:15:51" (3/3) ... [2024-11-19 11:15:51,413 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2024-11-19 11:15:51,431 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 11:15:51,432 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-19 11:15:51,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 11:15:51,504 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;@359b10fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 11:15:51,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 11:15:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.5) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 11:15:51,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:51,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:51,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:51,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:51,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1376423430, now seen corresponding path program 1 times [2024-11-19 11:15:51,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:15:51,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672893655] [2024-11-19 11:15:51,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:51,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:51,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:15:51,536 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 11:15:51,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 11:15:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:51,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 11:15:51,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:51,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:51,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 11:15:51,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672893655] [2024-11-19 11:15:51,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672893655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:51,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:51,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 11:15:51,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111279210] [2024-11-19 11:15:51,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:51,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 11:15:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 11:15:51,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 11:15:51,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 11:15:51,726 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.5) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:51,751 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2024-11-19 11:15:51,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 11:15:51,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-19 11:15:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:51,759 INFO L225 Difference]: With dead ends: 82 [2024-11-19 11:15:51,760 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 11:15:51,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 11:15:51,769 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:51,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 11:15:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-19 11:15:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-19 11:15:51,813 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 10 [2024-11-19 11:15:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:51,813 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-19 11:15:51,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-19 11:15:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 11:15:51,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:51,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:51,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 11:15:52,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:52,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:52,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:52,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1433681732, now seen corresponding path program 1 times [2024-11-19 11:15:52,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:15:52,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194994810] [2024-11-19 11:15:52,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:52,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:52,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:15:52,026 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 11:15:52,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 11:15:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:52,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 11:15:52,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:52,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:52,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 11:15:52,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194994810] [2024-11-19 11:15:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194994810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:52,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:52,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 11:15:52,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241364330] [2024-11-19 11:15:52,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:52,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:15:52,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 11:15:52,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:15:52,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:15:52,199 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:52,277 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-19 11:15:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:52,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-19 11:15:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:52,279 INFO L225 Difference]: With dead ends: 36 [2024-11-19 11:15:52,279 INFO L226 Difference]: Without dead ends: 35 [2024-11-19 11:15:52,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:15:52,280 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:52,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:15:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-19 11:15:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-19 11:15:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-19 11:15:52,292 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 10 [2024-11-19 11:15:52,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:52,296 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-19 11:15:52,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-19 11:15:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 11:15:52,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:52,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:52,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:52,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:52,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:52,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:52,500 INFO L85 PathProgramCache]: Analyzing trace with hash -150082737, now seen corresponding path program 1 times [2024-11-19 11:15:52,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:15:52,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044568255] [2024-11-19 11:15:52,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:52,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:52,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:15:52,503 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 11:15:52,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 11:15:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:52,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 11:15:52,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:52,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:52,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 11:15:52,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044568255] [2024-11-19 11:15:52,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044568255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:52,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:52,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 11:15:52,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817400714] [2024-11-19 11:15:52,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:52,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:15:52,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 11:15:52,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:15:52,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:15:52,597 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:52,723 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-11-19 11:15:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 11:15:52,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 11:15:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:52,725 INFO L225 Difference]: With dead ends: 59 [2024-11-19 11:15:52,726 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 11:15:52,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:15:52,729 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:52,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 139 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:15:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 11:15:52,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2024-11-19 11:15:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-19 11:15:52,743 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 14 [2024-11-19 11:15:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:52,744 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-19 11:15:52,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-19 11:15:52,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 11:15:52,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:52,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:52,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:52,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:52,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:52,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash -357603447, now seen corresponding path program 1 times [2024-11-19 11:15:52,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:15:52,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401920810] [2024-11-19 11:15:52,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:52,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:52,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:15:52,950 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 11:15:52,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 11:15:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:53,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:53,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:53,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:53,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 11:15:53,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401920810] [2024-11-19 11:15:53,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401920810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:53,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:53,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:15:53,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135047642] [2024-11-19 11:15:53,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:53,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 11:15:53,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:53,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:53,047 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:53,095 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-11-19 11:15:53,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:53,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 11:15:53,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:53,099 INFO L225 Difference]: With dead ends: 59 [2024-11-19 11:15:53,099 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 11:15:53,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:53,101 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 13 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:53,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 102 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 11:15:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2024-11-19 11:15:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-11-19 11:15:53,116 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 15 [2024-11-19 11:15:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:53,116 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-11-19 11:15:53,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-11-19 11:15:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 11:15:53,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:53,119 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:53,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:53,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:53,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:53,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1371174098, now seen corresponding path program 1 times [2024-11-19 11:15:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:15:53,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218071563] [2024-11-19 11:15:53,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:53,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:53,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:15:53,323 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 11:15:53,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 11:15:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:53,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:15:53,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:53,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:15:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:53,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 11:15:53,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218071563] [2024-11-19 11:15:53,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218071563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 11:15:53,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 11:15:53,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-19 11:15:53,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315977681] [2024-11-19 11:15:53,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 11:15:53,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 11:15:53,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 11:15:53,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 11:15:53,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:15:53,540 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:53,763 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2024-11-19 11:15:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 11:15:53,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-19 11:15:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:53,772 INFO L225 Difference]: With dead ends: 120 [2024-11-19 11:15:53,772 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 11:15:53,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-19 11:15:53,775 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 80 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:53,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 283 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:15:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 11:15:53,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 43. [2024-11-19 11:15:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-19 11:15:53,789 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 19 [2024-11-19 11:15:53,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:53,790 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-19 11:15:53,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-19 11:15:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 11:15:53,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:53,791 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:53,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 11:15:53,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:53,992 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:53,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash 963942463, now seen corresponding path program 1 times [2024-11-19 11:15:53,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:15:53,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837679816] [2024-11-19 11:15:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:53,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:53,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:15:53,996 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 11:15:53,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 11:15:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:54,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 11:15:54,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 11:15:54,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:15:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 11:15:54,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 11:15:54,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837679816] [2024-11-19 11:15:54,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837679816] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:54,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:54,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 11:15:54,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767462744] [2024-11-19 11:15:54,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:54,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 11:15:54,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:54,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:54,184 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:54,216 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-19 11:15:54,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:54,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-19 11:15:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:54,218 INFO L225 Difference]: With dead ends: 44 [2024-11-19 11:15:54,219 INFO L226 Difference]: Without dead ends: 43 [2024-11-19 11:15:54,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:54,220 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:54,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-19 11:15:54,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2024-11-19 11:15:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 11:15:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-19 11:15:54,233 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2024-11-19 11:15:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:54,233 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-19 11:15:54,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-19 11:15:54,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 11:15:54,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:54,235 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 11:15:54,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 11:15:54,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:54,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:54,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1264561129, now seen corresponding path program 1 times [2024-11-19 11:15:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:15:54,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084339914] [2024-11-19 11:15:54,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:54,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:54,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:15:54,444 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 11:15:54,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 11:15:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:54,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:54,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 11:15:54,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:54,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 11:15:54,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084339914] [2024-11-19 11:15:54,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084339914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:54,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:54,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:15:54,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722447276] [2024-11-19 11:15:54,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:54,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:54,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 11:15:54,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:54,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:54,535 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 11:15:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:54,574 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-19 11:15:54,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:54,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-11-19 11:15:54,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:54,575 INFO L225 Difference]: With dead ends: 40 [2024-11-19 11:15:54,575 INFO L226 Difference]: Without dead ends: 39 [2024-11-19 11:15:54,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:54,576 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:54,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-19 11:15:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-19 11:15:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 11:15:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-19 11:15:54,590 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 35 [2024-11-19 11:15:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:54,590 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-19 11:15:54,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 11:15:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-19 11:15:54,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 11:15:54,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:54,595 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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] [2024-11-19 11:15:54,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 11:15:54,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:54,796 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:54,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:54,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1924351826, now seen corresponding path program 1 times [2024-11-19 11:15:54,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:15:54,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811087751] [2024-11-19 11:15:54,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:54,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:54,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:15:54,800 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 11:15:54,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 11:15:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:54,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:15:54,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 11:15:54,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:15:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 11:15:55,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 11:15:55,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811087751] [2024-11-19 11:15:55,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811087751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 11:15:55,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 11:15:55,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-19 11:15:55,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545680044] [2024-11-19 11:15:55,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 11:15:55,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 11:15:55,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 11:15:55,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 11:15:55,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:15:55,031 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 11:15:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:55,172 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-11-19 11:15:55,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 11:15:55,173 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 45 [2024-11-19 11:15:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:55,173 INFO L225 Difference]: With dead ends: 52 [2024-11-19 11:15:55,173 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 11:15:55,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-19 11:15:55,175 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:55,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:15:55,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 11:15:55,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 11:15:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 11:15:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 11:15:55,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2024-11-19 11:15:55,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:55,176 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 11:15:55,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 11:15:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 11:15:55,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 11:15:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-19 11:15:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-19 11:15:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-19 11:15:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-19 11:15:55,181 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-19 11:15:55,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-19 11:15:55,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-19 11:15:55,182 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-19 11:15:55,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 11:15:55,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:15:55,388 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:55,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 11:15:55,928 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 11:15:55,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:15:55 BoogieIcfgContainer [2024-11-19 11:15:55,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 11:15:55,951 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 11:15:55,951 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 11:15:55,952 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 11:15:55,952 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:15:51" (3/4) ... [2024-11-19 11:15:55,954 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 11:15:55,958 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-19 11:15:55,958 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-19 11:15:55,963 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-19 11:15:55,964 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 11:15:55,965 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 11:15:55,965 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 11:15:56,066 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 11:15:56,069 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 11:15:56,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 11:15:56,070 INFO L158 Benchmark]: Toolchain (without parser) took 5600.19ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 25.0MB in the beginning and 54.9MB in the end (delta: -29.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:15:56,071 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 46.1MB. Free memory was 27.1MB in the beginning and 27.1MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:15:56,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.37ms. Allocated memory is still 58.7MB. Free memory was 24.8MB in the beginning and 27.5MB in the end (delta: -2.7MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-19 11:15:56,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.54ms. Allocated memory is still 58.7MB. Free memory was 27.5MB in the beginning and 25.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:15:56,072 INFO L158 Benchmark]: Boogie Preprocessor took 62.97ms. Allocated memory is still 58.7MB. Free memory was 25.9MB in the beginning and 23.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 11:15:56,072 INFO L158 Benchmark]: RCFGBuilder took 471.25ms. Allocated memory is still 58.7MB. Free memory was 23.6MB in the beginning and 25.2MB in the end (delta: -1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 11:15:56,072 INFO L158 Benchmark]: TraceAbstraction took 4545.93ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 24.6MB in the beginning and 59.7MB in the end (delta: -35.1MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-11-19 11:15:56,073 INFO L158 Benchmark]: Witness Printer took 118.18ms. Allocated memory is still 86.0MB. Free memory was 59.7MB in the beginning and 54.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 11:15:56,075 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.90ms. Allocated memory is still 46.1MB. Free memory was 27.1MB in the beginning and 27.1MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.37ms. Allocated memory is still 58.7MB. Free memory was 24.8MB in the beginning and 27.5MB in the end (delta: -2.7MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.54ms. Allocated memory is still 58.7MB. Free memory was 27.5MB in the beginning and 25.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.97ms. Allocated memory is still 58.7MB. Free memory was 25.9MB in the beginning and 23.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 471.25ms. Allocated memory is still 58.7MB. Free memory was 23.6MB in the beginning and 25.2MB in the end (delta: -1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4545.93ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 24.6MB in the beginning and 59.7MB in the end (delta: -35.1MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Witness Printer took 118.18ms. Allocated memory is still 86.0MB. Free memory was 59.7MB in the beginning and 54.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: 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 3 procedures, 45 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 1082 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 781 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 287 IncrementalHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 301 mSDtfsCounter, 287 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 112 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 519 SizeOfPredicates, 3 NumberOfNonLiveVariables, 455 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 48/74 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((n >= 0) && (n < 1073741824)) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((n >= 0) && (n < 1073741824)) - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (0 != cond) RESULT: Ultimate proved your program to be correct! [2024-11-19 11:15:56,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE