./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-09 12:20:15,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 12:20:15,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 12:20:15,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 12:20:15,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 12:20:15,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 12:20:15,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 12:20:15,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 12:20:15,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 12:20:15,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 12:20:15,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 12:20:15,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 12:20:15,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 12:20:15,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 12:20:15,614 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 12:20:15,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 12:20:15,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 12:20:15,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 12:20:15,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 12:20:15,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 12:20:15,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 12:20:15,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 12:20:15,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 12:20:15,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 12:20:15,624 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 12:20:15,624 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 12:20:15,624 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 12:20:15,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 12:20:15,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 12:20:15,625 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 12:20:15,625 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 12:20:15,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 12:20:15,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 12:20:15,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 12:20:15,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:20:15,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 12:20:15,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 12:20:15,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 12:20:15,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 12:20:15,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 12:20:15,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 12:20:15,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 12:20:15,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 12:20:15,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 12:20:15,634 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-09 12:20:15,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 12:20:15,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 12:20:15,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 12:20:15,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 12:20:15,947 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 12:20:15,949 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-09 12:20:17,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 12:20:17,616 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 12:20:17,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max.c [2024-11-09 12:20:17,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0db2dcee/70f9308b4e234480a0c7920546a157ae/FLAG60801ab26 [2024-11-09 12:20:17,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0db2dcee/70f9308b4e234480a0c7920546a157ae [2024-11-09 12:20:17,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 12:20:17,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 12:20:17,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 12:20:17,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 12:20:17,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 12:20:17,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:20:17" (1/1) ... [2024-11-09 12:20:17,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48623502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:17, skipping insertion in model container [2024-11-09 12:20:17,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:20:17" (1/1) ... [2024-11-09 12:20:18,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 12:20:18,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:20:18,224 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 12:20:18,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:20:18,259 INFO L204 MainTranslator]: Completed translation [2024-11-09 12:20:18,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18 WrapperNode [2024-11-09 12:20:18,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 12:20:18,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 12:20:18,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 12:20:18,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 12:20:18,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18" (1/1) ... [2024-11-09 12:20:18,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18" (1/1) ... [2024-11-09 12:20:18,292 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-11-09 12:20:18,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 12:20:18,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 12:20:18,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 12:20:18,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 12:20:18,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18" (1/1) ... [2024-11-09 12:20:18,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18" (1/1) ... [2024-11-09 12:20:18,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18" (1/1) ... [2024-11-09 12:20:18,320 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-09 12:20:18,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18" (1/1) ... [2024-11-09 12:20:18,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18" (1/1) ... [2024-11-09 12:20:18,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18" (1/1) ... [2024-11-09 12:20:18,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18" (1/1) ... [2024-11-09 12:20:18,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18" (1/1) ... [2024-11-09 12:20:18,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18" (1/1) ... [2024-11-09 12:20:18,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 12:20:18,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 12:20:18,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 12:20:18,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 12:20:18,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18" (1/1) ... [2024-11-09 12:20:18,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:20:18,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:18,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 12:20:18,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 12:20:18,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 12:20:18,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 12:20:18,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 12:20:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 12:20:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 12:20:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 12:20:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 12:20:18,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 12:20:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 12:20:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 12:20:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 12:20:18,438 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 12:20:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 12:20:18,526 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 12:20:18,529 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 12:20:18,837 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-09 12:20:18,837 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 12:20:18,849 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 12:20:18,850 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 12:20:18,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:20:18 BoogieIcfgContainer [2024-11-09 12:20:18,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 12:20:18,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 12:20:18,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 12:20:18,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 12:20:18,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:20:17" (1/3) ... [2024-11-09 12:20:18,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b327d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:20:18, skipping insertion in model container [2024-11-09 12:20:18,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:18" (2/3) ... [2024-11-09 12:20:18,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b327d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:20:18, skipping insertion in model container [2024-11-09 12:20:18,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:20:18" (3/3) ... [2024-11-09 12:20:18,858 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2024-11-09 12:20:18,874 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 12:20:18,874 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-09 12:20:18,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 12:20:18,929 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;@62c4b50e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 12:20:18,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 12:20:18,933 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-09 12:20:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 12:20:18,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:18,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:18,939 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-09 12:20:18,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:18,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1376423430, now seen corresponding path program 1 times [2024-11-09 12:20:18,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:18,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421586303] [2024-11-09 12:20:18,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:18,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:19,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:19,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:19,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421586303] [2024-11-09 12:20:19,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421586303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:19,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:19,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:20:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241695134] [2024-11-09 12:20:19,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:19,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 12:20:19,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:19,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 12:20:19,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 12:20:19,161 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-09 12:20:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:19,187 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2024-11-09 12:20:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 12:20:19,190 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-09 12:20:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:19,197 INFO L225 Difference]: With dead ends: 86 [2024-11-09 12:20:19,198 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 12:20:19,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 12:20:19,206 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-09 12:20:19,210 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-09 12:20:19,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 12:20:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 12:20:19,252 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-09 12:20:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-09 12:20:19,255 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 10 [2024-11-09 12:20:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:19,255 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-09 12:20:19,256 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-09 12:20:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-09 12:20:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 12:20:19,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:19,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:19,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 12:20:19,258 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-09 12:20:19,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1433681732, now seen corresponding path program 1 times [2024-11-09 12:20:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:19,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636493390] [2024-11-09 12:20:19,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:19,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:19,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:19,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:19,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:19,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636493390] [2024-11-09 12:20:19,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636493390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:19,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:19,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 12:20:19,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994794926] [2024-11-09 12:20:19,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:19,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:20:19,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:19,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:20:19,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:19,544 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-09 12:20:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:19,603 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-09 12:20:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:20:19,603 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-09 12:20:19,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:19,605 INFO L225 Difference]: With dead ends: 40 [2024-11-09 12:20:19,606 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 12:20:19,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09 12:20:19,608 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-09 12:20:19,609 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-09 12:20:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 12:20:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 12:20:19,619 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-09 12:20:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-09 12:20:19,621 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 10 [2024-11-09 12:20:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:19,623 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-09 12:20:19,623 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-09 12:20:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-09 12:20:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 12:20:19,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:19,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:19,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 12:20:19,627 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-09 12:20:19,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash -150082929, now seen corresponding path program 1 times [2024-11-09 12:20:19,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:19,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697707423] [2024-11-09 12:20:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:19,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:19,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:19,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:19,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697707423] [2024-11-09 12:20:19,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697707423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:19,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:19,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:20:19,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366051669] [2024-11-09 12:20:19,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:19,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:20:19,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:20:19,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:20:19,743 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-09 12:20:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:19,792 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2024-11-09 12:20:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:20:19,792 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-09 12:20:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:19,793 INFO L225 Difference]: With dead ends: 61 [2024-11-09 12:20:19,794 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 12:20:19,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09 12:20:19,795 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:19,796 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.0s Time] [2024-11-09 12:20:19,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 12:20:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2024-11-09 12:20:19,807 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-09 12:20:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-11-09 12:20:19,808 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 14 [2024-11-09 12:20:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:19,808 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-09 12:20:19,809 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-09 12:20:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-11-09 12:20:19,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 12:20:19,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:19,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:19,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 12:20:19,810 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-09 12:20:19,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:19,811 INFO L85 PathProgramCache]: Analyzing trace with hash -150082737, now seen corresponding path program 1 times [2024-11-09 12:20:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:19,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428706344] [2024-11-09 12:20:19,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:20,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:20,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428706344] [2024-11-09 12:20:20,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428706344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:20,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:20,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:20:20,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95207132] [2024-11-09 12:20:20,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:20,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:20:20,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:20,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:20:20,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:20:20,069 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-09 12:20:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:20,149 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2024-11-09 12:20:20,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:20:20,150 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-09 12:20:20,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:20,151 INFO L225 Difference]: With dead ends: 75 [2024-11-09 12:20:20,151 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 12:20:20,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-09 12:20:20,154 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:20,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 105 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:20:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 12:20:20,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 12:20:20,164 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-09 12:20:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-09 12:20:20,165 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 14 [2024-11-09 12:20:20,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:20,166 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-09 12:20:20,166 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-09 12:20:20,166 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-09 12:20:20,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 12:20:20,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:20,169 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:20,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 12:20:20,170 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-09 12:20:20,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1845346742, now seen corresponding path program 1 times [2024-11-09 12:20:20,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:20,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894553597] [2024-11-09 12:20:20,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:20,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:20,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:20,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894553597] [2024-11-09 12:20:20,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894553597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:20,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751347120] [2024-11-09 12:20:20,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:20,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:20,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:20,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:20:20,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 12:20:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:20,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:20:20,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:20,476 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-09 12:20:20,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:20,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751347120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:20,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:20:20,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 12:20:20,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323032945] [2024-11-09 12:20:20,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:20,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:20:20,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:20,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:20:20,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 12:20:20,479 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-09 12:20:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:20,542 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-11-09 12:20:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:20:20,542 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-09 12:20:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:20,543 INFO L225 Difference]: With dead ends: 51 [2024-11-09 12:20:20,543 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 12:20:20,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 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-09 12:20:20,544 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 26 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:20,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 133 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:20:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 12:20:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2024-11-09 12:20:20,554 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-09 12:20:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-09 12:20:20,556 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2024-11-09 12:20:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:20,556 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-09 12:20:20,557 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-09 12:20:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-09 12:20:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 12:20:20,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:20,559 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:20,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 12:20:20,759 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-09 12:20:20,760 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-09 12:20:20,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1371174098, now seen corresponding path program 1 times [2024-11-09 12:20:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:20,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772105327] [2024-11-09 12:20:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:20,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:20,836 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-09 12:20:20,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:20,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772105327] [2024-11-09 12:20:20,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772105327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:20,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455334967] [2024-11-09 12:20:20,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:20,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:20,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:20,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:20:20,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 12:20:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:20,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:20:20,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:20,941 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-09 12:20:20,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:21,017 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-09 12:20:21,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455334967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:21,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:20:21,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-09 12:20:21,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127186469] [2024-11-09 12:20:21,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:21,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 12:20:21,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 12:20:21,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 12:20:21,020 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-09 12:20:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:21,129 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2024-11-09 12:20:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 12:20:21,130 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-09 12:20:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:21,131 INFO L225 Difference]: With dead ends: 102 [2024-11-09 12:20:21,131 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 12:20:21,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 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-09 12:20:21,132 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 99 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:21,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 172 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:20:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 12:20:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 49. [2024-11-09 12:20:21,145 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-09 12:20:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-11-09 12:20:21,150 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 19 [2024-11-09 12:20:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:21,150 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-11-09 12:20:21,150 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-09 12:20:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-11-09 12:20:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 12:20:21,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:21,151 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-09 12:20:21,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:21,352 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-09 12:20:21,353 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-09 12:20:21,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1344681024, now seen corresponding path program 1 times [2024-11-09 12:20:21,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:21,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580155044] [2024-11-09 12:20:21,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:21,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:21,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:21,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 12:20:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:20:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:20:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:21,465 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-09 12:20:21,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:21,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580155044] [2024-11-09 12:20:21,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580155044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:21,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:21,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:20:21,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881866951] [2024-11-09 12:20:21,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:21,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:20:21,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:21,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:20:21,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:20:21,468 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-09 12:20:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:21,494 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2024-11-09 12:20:21,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:20:21,495 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-09 12:20:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:21,497 INFO L225 Difference]: With dead ends: 57 [2024-11-09 12:20:21,497 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 12:20:21,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-09 12:20:21,498 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-09 12:20:21,498 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-09 12:20:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 12:20:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-09 12:20:21,513 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-09 12:20:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2024-11-09 12:20:21,516 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2024-11-09 12:20:21,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:21,517 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2024-11-09 12:20:21,517 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-09 12:20:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-11-09 12:20:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 12:20:21,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:21,519 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:21,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 12:20:21,519 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-09 12:20:21,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash 485676829, now seen corresponding path program 2 times [2024-11-09 12:20:21,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:21,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194728301] [2024-11-09 12:20:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:21,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:21,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:21,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194728301] [2024-11-09 12:20:21,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194728301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:21,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724784570] [2024-11-09 12:20:21,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 12:20:21,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:21,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:21,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:20:21,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 12:20:21,811 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 12:20:21,811 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:20:21,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:20:21,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:21,915 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-09 12:20:21,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:22,022 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-09 12:20:22,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724784570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:22,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:20:22,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 19 [2024-11-09 12:20:22,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586029087] [2024-11-09 12:20:22,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:22,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 12:20:22,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:22,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 12:20:22,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-11-09 12:20:22,026 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 20 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 20 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:20:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:22,534 INFO L93 Difference]: Finished difference Result 174 states and 209 transitions. [2024-11-09 12:20:22,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 12:20:22,535 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 20 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2024-11-09 12:20:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:22,536 INFO L225 Difference]: With dead ends: 174 [2024-11-09 12:20:22,536 INFO L226 Difference]: Without dead ends: 173 [2024-11-09 12:20:22,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=355, Invalid=1205, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 12:20:22,541 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 158 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:22,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 494 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:20:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-09 12:20:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 38. [2024-11-09 12:20:22,561 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-09 12:20:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-09 12:20:22,565 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 31 [2024-11-09 12:20:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:22,565 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-09 12:20:22,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 20 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:20:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-09 12:20:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 12:20:22,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:22,567 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-09 12:20:22,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:22,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:22,772 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-09 12:20:22,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:22,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1600492123, now seen corresponding path program 1 times [2024-11-09 12:20:22,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:22,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103419309] [2024-11-09 12:20:22,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 12:20:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:20:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:20:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 12:20:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,972 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-09 12:20:22,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:22,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103419309] [2024-11-09 12:20:22,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103419309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:22,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165895978] [2024-11-09 12:20:22,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:22,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:22,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:22,975 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:20:22,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 12:20:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 12:20:23,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:23,143 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-09 12:20:23,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:23,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165895978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:23,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:20:23,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2024-11-09 12:20:23,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450184199] [2024-11-09 12:20:23,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:23,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 12:20:23,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:23,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 12:20:23,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-09 12:20:23,149 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-09 12:20:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:23,244 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-09 12:20:23,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 12:20:23,244 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-09 12:20:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:23,246 INFO L225 Difference]: With dead ends: 64 [2024-11-09 12:20:23,246 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 12:20:23,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 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-09 12:20:23,248 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:23,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 142 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:20:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 12:20:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-09 12:20:23,260 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-09 12:20:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-09 12:20:23,263 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 44 [2024-11-09 12:20:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:23,263 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-09 12:20:23,263 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-09 12:20:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-09 12:20:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 12:20:23,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:23,264 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-09 12:20:23,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:23,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:23,465 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-09 12:20:23,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:23,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1468385312, now seen corresponding path program 1 times [2024-11-09 12:20:23,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:23,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41553877] [2024-11-09 12:20:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:23,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 12:20:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 12:20:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 12:20:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 12:20:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,581 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-09 12:20:23,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:23,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41553877] [2024-11-09 12:20:23,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41553877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:23,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307565889] [2024-11-09 12:20:23,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:23,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:23,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:23,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:20:23,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 12:20:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:20:23,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:23,696 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-09 12:20:23,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:23,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307565889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:23,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:20:23,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 12:20:23,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216977617] [2024-11-09 12:20:23,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:23,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:20:23,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:23,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:20:23,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 12:20:23,699 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-09 12:20:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:23,735 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-09 12:20:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:20:23,735 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-09 12:20:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:23,736 INFO L225 Difference]: With dead ends: 39 [2024-11-09 12:20:23,736 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 12:20:23,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 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-09 12:20:23,737 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 143 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:23,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 143 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:20:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 12:20:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 12:20:23,752 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-09 12:20:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-09 12:20:23,753 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 48 [2024-11-09 12:20:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:23,753 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-09 12:20:23,754 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-09 12:20:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-09 12:20:23,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 12:20:23,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:23,755 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-09 12:20:23,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:23,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 12:20:23,959 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-09 12:20:23,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:23,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1724695497, now seen corresponding path program 1 times [2024-11-09 12:20:23,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:23,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936767766] [2024-11-09 12:20:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:23,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 12:20:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 12:20:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 12:20:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 12:20:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,067 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-09 12:20:24,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:24,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936767766] [2024-11-09 12:20:24,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936767766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246933609] [2024-11-09 12:20:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:24,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:24,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:24,070 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:20:24,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 12:20:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:20:24,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:24,173 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-09 12:20:24,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:24,233 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-09 12:20:24,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246933609] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:24,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:20:24,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-09 12:20:24,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127072189] [2024-11-09 12:20:24,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:24,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 12:20:24,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:24,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 12:20:24,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 12:20:24,236 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-09 12:20:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:24,286 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-11-09 12:20:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 12:20:24,287 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-09 12:20:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:24,287 INFO L225 Difference]: With dead ends: 57 [2024-11-09 12:20:24,288 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 12:20:24,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 12:20:24,288 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:24,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:20:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 12:20:24,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 12:20:24,297 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-09 12:20:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-11-09 12:20:24,298 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 49 [2024-11-09 12:20:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:24,298 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-11-09 12:20:24,298 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-09 12:20:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-11-09 12:20:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 12:20:24,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:24,300 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-09 12:20:24,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 12:20:24,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:24,502 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-09 12:20:24,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:24,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1839834280, now seen corresponding path program 2 times [2024-11-09 12:20:24,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:24,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682480602] [2024-11-09 12:20:24,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 12:20:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 12:20:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 12:20:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 12:20:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 12:20:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 12:20:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:20:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 41 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 12:20:24,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:24,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682480602] [2024-11-09 12:20:24,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682480602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:24,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321341734] [2024-11-09 12:20:24,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 12:20:24,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:24,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:24,869 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:20:24,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 12:20:24,977 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 12:20:24,977 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:20:24,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 12:20:24,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:25,187 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-09 12:20:25,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:25,378 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-09 12:20:25,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321341734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:25,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:20:25,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 30 [2024-11-09 12:20:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581230680] [2024-11-09 12:20:25,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:25,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 12:20:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:25,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 12:20:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2024-11-09 12:20:25,381 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 10 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-09 12:20:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:25,581 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2024-11-09 12:20:25,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 12:20:25,582 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 10 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 79 [2024-11-09 12:20:25,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:25,583 INFO L225 Difference]: With dead ends: 101 [2024-11-09 12:20:25,583 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 12:20:25,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2024-11-09 12:20:25,585 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:25,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 363 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:20:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 12:20:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-11-09 12:20:25,593 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-09 12:20:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-11-09 12:20:25,594 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 79 [2024-11-09 12:20:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:25,595 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-11-09 12:20:25,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 10 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-09 12:20:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-11-09 12:20:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 12:20:25,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:25,601 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-09 12:20:25,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 12:20:25,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:25,806 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-09 12:20:25,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash -888135603, now seen corresponding path program 3 times [2024-11-09 12:20:25,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:25,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487022742] [2024-11-09 12:20:25,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:25,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:26,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 12:20:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:26,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 12:20:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 12:20:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:26,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 12:20:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:26,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:20:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:26,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 12:20:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:26,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 12:20:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 42 proven. 19 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 12:20:26,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:26,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487022742] [2024-11-09 12:20:26,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487022742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:26,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083290514] [2024-11-09 12:20:26,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 12:20:26,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:26,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:26,128 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:20:26,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 12:20:26,199 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 12:20:26,199 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:20:26,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 12:20:26,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:26,320 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-09 12:20:26,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:26,432 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-09 12:20:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083290514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:26,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:20:26,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 4] total 19 [2024-11-09 12:20:26,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362263251] [2024-11-09 12:20:26,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:26,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 12:20:26,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:26,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 12:20:26,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-09 12:20:26,435 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-09 12:20:26,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:26,763 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2024-11-09 12:20:26,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 12:20:26,763 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 83 [2024-11-09 12:20:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:26,764 INFO L225 Difference]: With dead ends: 104 [2024-11-09 12:20:26,764 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 12:20:26,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 12:20:26,768 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:26,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 257 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:20:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 12:20:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 12:20:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:20:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 12:20:26,770 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2024-11-09 12:20:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:26,770 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 12:20:26,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-09 12:20:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 12:20:26,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 12:20:26,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-09 12:20:26,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-09 12:20:26,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-09 12:20:26,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-09 12:20:26,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-09 12:20:26,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-09 12:20:26,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-09 12:20:26,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-09 12:20:26,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:26,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 12:20:26,980 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:26,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 12:20:30,485 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 12:20:30,493 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.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-09 12:20:30,499 INFO L158 Benchmark]: Toolchain (without parser) took 12510.50ms. Allocated memory was 197.1MB in the beginning and 463.5MB in the end (delta: 266.3MB). Free memory was 129.2MB in the beginning and 285.9MB in the end (delta: -156.7MB). Peak memory consumption was 188.6MB. Max. memory is 16.1GB. [2024-11-09 12:20:30,499 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 197.1MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:20:30,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.37ms. Allocated memory is still 197.1MB. Free memory was 128.9MB in the beginning and 116.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 12:20:30,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.93ms. Allocated memory is still 197.1MB. Free memory was 116.6MB in the beginning and 114.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:20:30,500 INFO L158 Benchmark]: Boogie Preprocessor took 41.38ms. Allocated memory is still 197.1MB. Free memory was 114.7MB in the beginning and 112.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:20:30,500 INFO L158 Benchmark]: RCFGBuilder took 513.95ms. Allocated memory is still 197.1MB. Free memory was 112.7MB in the beginning and 160.2MB in the end (delta: -47.5MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-09 12:20:30,500 INFO L158 Benchmark]: TraceAbstraction took 11646.02ms. Allocated memory was 197.1MB in the beginning and 463.5MB in the end (delta: 266.3MB). Free memory was 159.7MB in the beginning and 285.9MB in the end (delta: -126.2MB). Peak memory consumption was 219.9MB. Max. memory is 16.1GB. [2024-11-09 12:20:30,506 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.21ms. Allocated memory is still 197.1MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.37ms. Allocated memory is still 197.1MB. Free memory was 128.9MB in the beginning and 116.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.93ms. Allocated memory is still 197.1MB. Free memory was 116.6MB in the beginning and 114.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.38ms. Allocated memory is still 197.1MB. Free memory was 114.7MB in the beginning and 112.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 513.95ms. Allocated memory is still 197.1MB. Free memory was 112.7MB in the beginning and 160.2MB in the end (delta: -47.5MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11646.02ms. Allocated memory was 197.1MB in the beginning and 463.5MB in the end (delta: 266.3MB). Free memory was 159.7MB in the beginning and 285.9MB in the end (delta: -126.2MB). Peak memory consumption was 219.9MB. 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: 8.1s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 391 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 2313 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1845 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1214 IncrementalHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 468 mSDtfsCounter, 1214 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 831 GetRequests, 668 SyntacticMatches, 6 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=12, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 217 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 824 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1059 ConstructedInterpolants, 0 QuantifiedInterpolants, 2414 SizeOfPredicates, 12 NumberOfNonLiveVariables, 997 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 882/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-09 12:20:30,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-?-c7c6ca5-m [2024-11-09 12:20:32,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 12:20:32,964 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-11-09 12:20:32,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 12:20:32,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 12:20:33,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 12:20:33,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 12:20:33,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 12:20:33,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 12:20:33,013 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 12:20:33,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 12:20:33,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 12:20:33,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 12:20:33,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 12:20:33,018 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 12:20:33,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 12:20:33,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 12:20:33,019 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 12:20:33,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 12:20:33,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 12:20:33,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 12:20:33,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 12:20:33,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 12:20:33,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 12:20:33,024 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 12:20:33,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 12:20:33,025 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 12:20:33,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 12:20:33,025 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 12:20:33,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 12:20:33,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 12:20:33,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 12:20:33,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 12:20:33,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 12:20:33,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 12:20:33,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 12:20:33,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:20:33,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 12:20:33,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 12:20:33,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 12:20:33,029 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 12:20:33,029 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 12:20:33,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 12:20:33,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 12:20:33,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 12:20:33,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 12:20:33,030 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-09 12:20:33,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 12:20:33,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 12:20:33,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 12:20:33,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 12:20:33,422 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 12:20:33,423 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-09 12:20:35,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 12:20:35,292 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 12:20:35,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max.c [2024-11-09 12:20:35,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee288d189/2f56b976a2264f318b4c5c8fc82cbcfb/FLAG1a3383100 [2024-11-09 12:20:35,330 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee288d189/2f56b976a2264f318b4c5c8fc82cbcfb [2024-11-09 12:20:35,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 12:20:35,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 12:20:35,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 12:20:35,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 12:20:35,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 12:20:35,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1327cea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35, skipping insertion in model container [2024-11-09 12:20:35,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 12:20:35,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:20:35,619 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 12:20:35,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:20:35,669 INFO L204 MainTranslator]: Completed translation [2024-11-09 12:20:35,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35 WrapperNode [2024-11-09 12:20:35,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 12:20:35,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 12:20:35,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 12:20:35,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 12:20:35,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,711 INFO L138 Inliner]: procedures = 20, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-11-09 12:20:35,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 12:20:35,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 12:20:35,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 12:20:35,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 12:20:35,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,747 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-09 12:20:35,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 12:20:35,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 12:20:35,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 12:20:35,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 12:20:35,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35" (1/1) ... [2024-11-09 12:20:35,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:20:35,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:35,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 12:20:35,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 12:20:35,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 12:20:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 12:20:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 12:20:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 12:20:35,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 12:20:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 12:20:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 12:20:35,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 12:20:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 12:20:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 12:20:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 12:20:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 12:20:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 12:20:35,977 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 12:20:35,980 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 12:20:36,213 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-09 12:20:36,215 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 12:20:36,233 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 12:20:36,233 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 12:20:36,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:20:36 BoogieIcfgContainer [2024-11-09 12:20:36,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 12:20:36,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 12:20:36,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 12:20:36,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 12:20:36,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:20:35" (1/3) ... [2024-11-09 12:20:36,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b39948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:20:36, skipping insertion in model container [2024-11-09 12:20:36,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:35" (2/3) ... [2024-11-09 12:20:36,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b39948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:20:36, skipping insertion in model container [2024-11-09 12:20:36,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:20:36" (3/3) ... [2024-11-09 12:20:36,245 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2024-11-09 12:20:36,271 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 12:20:36,271 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-09 12:20:36,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 12:20:36,347 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;@31ef1839, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 12:20:36,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 12:20:36,352 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-09 12:20:36,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 12:20:36,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:36,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:36,362 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-09 12:20:36,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1376423430, now seen corresponding path program 1 times [2024-11-09 12:20:36,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 12:20:36,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102827399] [2024-11-09 12:20:36,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:36,392 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-09 12:20:36,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 12:20:36,396 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-09 12:20:36,397 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-09 12:20:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 12:20:36,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:36,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:36,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 12:20:36,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102827399] [2024-11-09 12:20:36,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102827399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:36,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:36,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:20:36,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177013251] [2024-11-09 12:20:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:36,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 12:20:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 12:20:36,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 12:20:36,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 12:20:36,575 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-09 12:20:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:36,600 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2024-11-09 12:20:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 12:20:36,603 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-09 12:20:36,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:36,610 INFO L225 Difference]: With dead ends: 82 [2024-11-09 12:20:36,610 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 12:20:36,614 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-09 12:20:36,617 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-09 12:20:36,622 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-09 12:20:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 12:20:36,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 12:20:36,661 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-09 12:20:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-09 12:20:36,666 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 10 [2024-11-09 12:20:36,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:36,668 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-09 12:20:36,668 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-09 12:20:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-09 12:20:36,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 12:20:36,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:36,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:36,675 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 (2)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:36,871 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-09 12:20:36,872 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-09 12:20:36,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:36,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1433681732, now seen corresponding path program 1 times [2024-11-09 12:20:36,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 12:20:36,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774540376] [2024-11-09 12:20:36,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:36,874 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-09 12:20:36,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 12:20:36,894 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-09 12:20:36,897 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-09 12:20:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 12:20:36,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:37,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:37,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 12:20:37,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774540376] [2024-11-09 12:20:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774540376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:37,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:37,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 12:20:37,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878189617] [2024-11-09 12:20:37,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:37,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:20:37,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 12:20:37,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:20:37,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:37,073 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-09 12:20:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:37,153 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-09 12:20:37,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:20:37,156 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-09 12:20:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:37,157 INFO L225 Difference]: With dead ends: 36 [2024-11-09 12:20:37,157 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 12:20:37,157 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-09 12:20:37,158 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-09 12:20:37,159 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-09 12:20:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 12:20:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 12:20:37,169 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-09 12:20:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-09 12:20:37,170 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 10 [2024-11-09 12:20:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:37,171 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-09 12:20:37,172 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-09 12:20:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-09 12:20:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 12:20:37,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:37,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:37,179 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-09 12:20:37,377 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-09 12:20:37,378 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-09 12:20:37,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:37,379 INFO L85 PathProgramCache]: Analyzing trace with hash -150082737, now seen corresponding path program 1 times [2024-11-09 12:20:37,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 12:20:37,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927932941] [2024-11-09 12:20:37,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:37,380 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-09 12:20:37,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 12:20:37,383 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-09 12:20:37,386 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-09 12:20:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:37,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 12:20:37,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:37,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:37,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 12:20:37,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927932941] [2024-11-09 12:20:37,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927932941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:37,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:37,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 12:20:37,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637552913] [2024-11-09 12:20:37,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:37,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:20:37,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 12:20:37,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:20:37,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:37,487 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-09 12:20:37,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:37,592 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-11-09 12:20:37,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:20:37,593 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-09 12:20:37,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:37,594 INFO L225 Difference]: With dead ends: 59 [2024-11-09 12:20:37,594 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 12:20:37,595 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-09 12:20:37,596 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-09 12:20:37,597 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-09 12:20:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 12:20:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2024-11-09 12:20:37,611 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-09 12:20:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-09 12:20:37,613 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 14 [2024-11-09 12:20:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:37,613 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-09 12:20:37,614 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-09 12:20:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-09 12:20:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 12:20:37,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:37,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:37,622 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 (4)] Ended with exit code 0 [2024-11-09 12:20:37,819 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-09 12:20:37,820 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-09 12:20:37,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:37,821 INFO L85 PathProgramCache]: Analyzing trace with hash -357603447, now seen corresponding path program 1 times [2024-11-09 12:20:37,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 12:20:37,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105611533] [2024-11-09 12:20:37,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:37,822 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-09 12:20:37,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 12:20:37,827 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-09 12:20:37,828 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-09 12:20:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:37,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:20:37,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:37,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:37,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 12:20:37,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105611533] [2024-11-09 12:20:37,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105611533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:37,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:37,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:20:37,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73395134] [2024-11-09 12:20:37,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:37,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:20:37,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 12:20:37,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:20:37,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:20:37,928 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-09 12:20:37,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:37,991 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-11-09 12:20:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:20:37,994 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-09 12:20:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:37,995 INFO L225 Difference]: With dead ends: 59 [2024-11-09 12:20:37,996 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 12:20:37,996 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-09 12:20:37,997 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-09 12:20:37,997 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-09 12:20:37,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 12:20:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2024-11-09 12:20:38,005 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-09 12:20:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-11-09 12:20:38,006 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 15 [2024-11-09 12:20:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:38,006 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-11-09 12:20:38,007 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-09 12:20:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-11-09 12:20:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 12:20:38,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:38,008 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:38,013 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-09 12:20:38,208 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-09 12:20:38,209 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-09 12:20:38,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1371174098, now seen corresponding path program 1 times [2024-11-09 12:20:38,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 12:20:38,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415069657] [2024-11-09 12:20:38,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:38,211 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-09 12:20:38,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 12:20:38,214 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-09 12:20:38,215 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-09 12:20:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:38,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:20:38,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:38,361 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-09 12:20:38,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:38,469 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-09 12:20:38,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 12:20:38,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415069657] [2024-11-09 12:20:38,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415069657] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:38,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:20:38,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-09 12:20:38,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178424229] [2024-11-09 12:20:38,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:38,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 12:20:38,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 12:20:38,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 12:20:38,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:20:38,474 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-09 12:20:38,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:38,717 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2024-11-09 12:20:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 12:20:38,718 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-09 12:20:38,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:38,719 INFO L225 Difference]: With dead ends: 120 [2024-11-09 12:20:38,719 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 12:20:38,720 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-09 12:20:38,720 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-09 12:20:38,721 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-09 12:20:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 12:20:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 43. [2024-11-09 12:20:38,750 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-09 12:20:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-09 12:20:38,751 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 19 [2024-11-09 12:20:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:38,752 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-09 12:20:38,752 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-09 12:20:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-09 12:20:38,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 12:20:38,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:38,753 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-09 12:20:38,769 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-09 12:20:38,957 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-09 12:20:38,958 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-09 12:20:38,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash 963942463, now seen corresponding path program 1 times [2024-11-09 12:20:38,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 12:20:38,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663258151] [2024-11-09 12:20:38,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:38,959 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-09 12:20:38,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 12:20:38,962 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-09 12:20:38,963 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-09 12:20:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:39,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 12:20:39,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:39,081 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-09 12:20:39,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:39,143 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-09 12:20:39,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 12:20:39,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663258151] [2024-11-09 12:20:39,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663258151] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:39,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:20:39,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-09 12:20:39,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207832291] [2024-11-09 12:20:39,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:39,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:20:39,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 12:20:39,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:20:39,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:20:39,150 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-09 12:20:39,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:39,186 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-09 12:20:39,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:20:39,187 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-09 12:20:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:39,189 INFO L225 Difference]: With dead ends: 44 [2024-11-09 12:20:39,189 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 12:20:39,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:20:39,193 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-09 12:20:39,193 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-09 12:20:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 12:20:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2024-11-09 12:20:39,203 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-09 12:20:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-09 12:20:39,204 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2024-11-09 12:20:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:39,204 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-09 12:20:39,204 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-09 12:20:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-09 12:20:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 12:20:39,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:39,205 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-09 12:20:39,211 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 (7)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:39,409 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-09 12:20:39,410 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-09 12:20:39,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:39,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1264561129, now seen corresponding path program 1 times [2024-11-09 12:20:39,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 12:20:39,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245318147] [2024-11-09 12:20:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:39,412 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-09 12:20:39,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 12:20:39,413 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-09 12:20:39,415 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-09 12:20:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:39,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:20:39,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:39,499 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-09 12:20:39,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:39,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 12:20:39,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245318147] [2024-11-09 12:20:39,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245318147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:39,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:39,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:20:39,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701901997] [2024-11-09 12:20:39,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:39,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:20:39,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 12:20:39,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:20:39,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:20:39,512 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-09 12:20:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:39,556 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-09 12:20:39,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:20:39,557 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-09 12:20:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:39,558 INFO L225 Difference]: With dead ends: 40 [2024-11-09 12:20:39,558 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 12:20:39,558 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-09 12:20:39,559 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-09 12:20:39,559 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-09 12:20:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 12:20:39,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 12:20:39,576 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-09 12:20:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-09 12:20:39,577 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 35 [2024-11-09 12:20:39,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:39,577 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-09 12:20:39,579 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-09 12:20:39,579 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-09 12:20:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 12:20:39,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:39,580 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-09 12:20:39,586 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 (8)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:39,781 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-09 12:20:39,781 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-09 12:20:39,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:39,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1924351826, now seen corresponding path program 1 times [2024-11-09 12:20:39,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 12:20:39,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875962735] [2024-11-09 12:20:39,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:39,783 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-09 12:20:39,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 12:20:39,786 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-09 12:20:39,788 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-09 12:20:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:39,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:20:39,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:39,920 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-09 12:20:39,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:40,047 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-09 12:20:40,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 12:20:40,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875962735] [2024-11-09 12:20:40,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875962735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:40,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:20:40,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-09 12:20:40,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866347001] [2024-11-09 12:20:40,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:40,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 12:20:40,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 12:20:40,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 12:20:40,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:20:40,051 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-09 12:20:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:40,199 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-11-09 12:20:40,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 12:20:40,199 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-09 12:20:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:40,200 INFO L225 Difference]: With dead ends: 52 [2024-11-09 12:20:40,200 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 12:20:40,201 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-09 12:20:40,201 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-09 12:20:40,201 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-09 12:20:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 12:20:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 12:20:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:20:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 12:20:40,206 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2024-11-09 12:20:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:40,206 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 12:20:40,206 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-09 12:20:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 12:20:40,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 12:20:40,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-09 12:20:40,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-09 12:20:40,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-09 12:20:40,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-09 12:20:40,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-09 12:20:40,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-09 12:20:40,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-09 12:20:40,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-09 12:20:40,218 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 (9)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:40,413 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-09 12:20:40,417 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:40,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 12:20:40,885 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 12:20:40,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:20:40 BoogieIcfgContainer [2024-11-09 12:20:40,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 12:20:40,950 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 12:20:40,951 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 12:20:40,951 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 12:20:40,952 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:20:36" (3/4) ... [2024-11-09 12:20:40,954 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 12:20:40,959 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 12:20:40,959 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 12:20:40,965 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 12:20:40,966 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 12:20:40,966 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 12:20:40,966 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 12:20:41,088 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 12:20:41,088 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 12:20:41,088 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 12:20:41,089 INFO L158 Benchmark]: Toolchain (without parser) took 5753.66ms. Allocated memory was 60.8MB in the beginning and 104.9MB in the end (delta: 44.0MB). Free memory was 31.8MB in the beginning and 75.7MB in the end (delta: -43.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:20:41,089 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 60.8MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:20:41,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.14ms. Allocated memory was 60.8MB in the beginning and 86.0MB in the end (delta: 25.2MB). Free memory was 31.6MB in the beginning and 60.0MB in the end (delta: -28.4MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-09 12:20:41,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.84ms. Allocated memory is still 86.0MB. Free memory was 60.0MB in the beginning and 58.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:20:41,090 INFO L158 Benchmark]: Boogie Preprocessor took 63.11ms. Allocated memory is still 86.0MB. Free memory was 58.3MB in the beginning and 56.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:20:41,090 INFO L158 Benchmark]: RCFGBuilder took 456.84ms. Allocated memory is still 86.0MB. Free memory was 56.2MB in the beginning and 41.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 12:20:41,091 INFO L158 Benchmark]: TraceAbstraction took 4713.13ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 40.9MB in the beginning and 81.0MB in the end (delta: -40.1MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-11-09 12:20:41,091 INFO L158 Benchmark]: Witness Printer took 137.98ms. Allocated memory is still 104.9MB. Free memory was 81.0MB in the beginning and 75.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 12:20:41,094 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.22ms. Allocated memory is still 60.8MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.14ms. Allocated memory was 60.8MB in the beginning and 86.0MB in the end (delta: 25.2MB). Free memory was 31.6MB in the beginning and 60.0MB in the end (delta: -28.4MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.84ms. Allocated memory is still 86.0MB. Free memory was 60.0MB in the beginning and 58.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.11ms. Allocated memory is still 86.0MB. Free memory was 58.3MB in the beginning and 56.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 456.84ms. Allocated memory is still 86.0MB. Free memory was 56.2MB in the beginning and 41.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4713.13ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 40.9MB in the beginning and 81.0MB in the end (delta: -40.1MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Witness Printer took 137.98ms. Allocated memory is still 104.9MB. Free memory was 81.0MB in the beginning and 75.7MB in the end (delta: 5.4MB). 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: 4.1s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, 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.4s 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.8s 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-09 12:20:41,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE