./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound100.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aca8f035d06c0b5071d069d3e7dfc8602e7f38b097f4966dbc919eb2aff21501 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:39:21,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:39:21,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:39:21,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:39:21,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:39:21,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:39:21,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:39:21,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:39:21,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:39:21,939 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:39:21,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:39:21,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:39:21,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:39:21,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:39:21,950 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:39:21,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:39:21,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:39:21,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:39:21,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:39:21,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:39:21,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:39:21,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:39:21,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:39:21,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:39:21,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:39:21,956 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:39:21,956 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:39:21,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:39:21,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:39:21,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:39:21,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:39:21,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:39:21,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:39:21,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:39:21,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:39:21,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:39:21,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:39:21,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:39:21,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:39:21,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:39:21,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:39:21,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:39:21,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:39:21,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:39:21,960 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 -> aca8f035d06c0b5071d069d3e7dfc8602e7f38b097f4966dbc919eb2aff21501 [2024-11-09 11:39:22,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:39:22,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:39:22,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:39:22,229 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:39:22,230 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:39:22,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound100.i [2024-11-09 11:39:23,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:39:23,977 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:39:23,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound100.i [2024-11-09 11:39:23,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921afdeb1/69ed383b3f864d02966fe0bca4ccd258/FLAG8bbc5481e [2024-11-09 11:39:24,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921afdeb1/69ed383b3f864d02966fe0bca4ccd258 [2024-11-09 11:39:24,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:39:24,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:39:24,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:39:24,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:39:24,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:39:24,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158a2f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24, skipping insertion in model container [2024-11-09 11:39:24,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:39:24,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:39:24,586 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:39:24,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:39:24,616 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:39:24,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24 WrapperNode [2024-11-09 11:39:24,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:39:24,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:39:24,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:39:24,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:39:24,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,644 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-11-09 11:39:24,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:39:24,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:39:24,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:39:24,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:39:24,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,664 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:39:24,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:39:24,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:39:24,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:39:24,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:39:24,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:39:24,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:24,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:39:24,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:39:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:39:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 11:39:24,748 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 11:39:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:39:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:39:24,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:39:24,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:39:24,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:39:24,828 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:39:24,830 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:39:24,989 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 11:39:24,989 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:39:24,999 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:39:24,999 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:39:24,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:39:24 BoogieIcfgContainer [2024-11-09 11:39:24,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:39:25,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:39:25,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:39:25,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:39:25,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:39:24" (1/3) ... [2024-11-09 11:39:25,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353ee87b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:39:25, skipping insertion in model container [2024-11-09 11:39:25,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (2/3) ... [2024-11-09 11:39:25,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353ee87b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:39:25, skipping insertion in model container [2024-11-09 11:39:25,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:39:24" (3/3) ... [2024-11-09 11:39:25,006 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound100.i [2024-11-09 11:39:25,018 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:39:25,018 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 11:39:25,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:39:25,063 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;@3d22b232, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:39:25,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 11:39:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 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 11:39:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:39:25,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:25,072 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:25,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:25,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:25,076 INFO L85 PathProgramCache]: Analyzing trace with hash -604571617, now seen corresponding path program 1 times [2024-11-09 11:39:25,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:25,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230021200] [2024-11-09 11:39:25,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:25,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:25,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:25,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230021200] [2024-11-09 11:39:25,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230021200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:25,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:25,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:39:25,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748215273] [2024-11-09 11:39:25,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:25,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 11:39:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:25,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 11:39:25,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:39:25,321 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:39:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:25,340 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2024-11-09 11:39:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 11:39:25,342 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-09 11:39:25,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:25,349 INFO L225 Difference]: With dead ends: 70 [2024-11-09 11:39:25,349 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 11:39:25,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:39:25,355 INFO L432 NwaCegarLoop]: 42 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, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:25,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 11:39:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 11:39:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-09 11:39:25,388 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2024-11-09 11:39:25,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:25,389 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-09 11:39:25,389 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:39:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 11:39:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:39:25,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:25,390 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:25,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:39:25,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:25,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:25,392 INFO L85 PathProgramCache]: Analyzing trace with hash 153751263, now seen corresponding path program 1 times [2024-11-09 11:39:25,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:25,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433181074] [2024-11-09 11:39:25,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:25,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:25,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:25,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433181074] [2024-11-09 11:39:25,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433181074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:25,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:25,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:39:25,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247161105] [2024-11-09 11:39:25,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:25,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:39:25,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:25,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:39:25,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:39:25,514 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:25,552 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-09 11:39:25,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:39:25,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-11-09 11:39:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:25,553 INFO L225 Difference]: With dead ends: 34 [2024-11-09 11:39:25,553 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 11:39:25,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:39:25,555 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:25,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 11:39:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-11-09 11:39:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-09 11:39:25,559 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2024-11-09 11:39:25,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:25,561 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-09 11:39:25,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-09 11:39:25,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 11:39:25,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:25,562 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:25,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:39:25,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:25,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:25,563 INFO L85 PathProgramCache]: Analyzing trace with hash 471321901, now seen corresponding path program 1 times [2024-11-09 11:39:25,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:25,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653865916] [2024-11-09 11:39:25,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:25,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:25,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:25,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653865916] [2024-11-09 11:39:25,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653865916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:25,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:25,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:39:25,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699820883] [2024-11-09 11:39:25,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:25,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:39:25,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:25,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:39:25,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:39:25,635 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:25,682 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-11-09 11:39:25,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:39:25,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-11-09 11:39:25,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:25,684 INFO L225 Difference]: With dead ends: 46 [2024-11-09 11:39:25,684 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 11:39:25,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:39:25,685 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:25,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 11:39:25,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 11:39:25,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 11:39:25,691 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2024-11-09 11:39:25,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:25,691 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 11:39:25,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 11:39:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 11:39:25,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:25,692 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:25,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:39:25,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:25,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:25,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2080735310, now seen corresponding path program 1 times [2024-11-09 11:39:25,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:25,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464244412] [2024-11-09 11:39:25,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:25,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:25,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:25,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464244412] [2024-11-09 11:39:25,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464244412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:25,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:25,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:39:25,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617405744] [2024-11-09 11:39:25,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:25,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:39:25,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:25,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:39:25,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:39:25,814 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:25,911 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-09 11:39:25,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:39:25,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 11:39:25,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:25,915 INFO L225 Difference]: With dead ends: 32 [2024-11-09 11:39:25,915 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 11:39:25,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:39:25,916 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:25,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 63 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:39:25,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 11:39:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 11:39:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-09 11:39:25,922 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2024-11-09 11:39:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:25,922 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-09 11:39:25,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-09 11:39:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 11:39:25,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:25,923 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:25,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:39:25,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:25,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:25,924 INFO L85 PathProgramCache]: Analyzing trace with hash -78285105, now seen corresponding path program 1 times [2024-11-09 11:39:25,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:25,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790925466] [2024-11-09 11:39:25,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:25,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:26,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:26,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790925466] [2024-11-09 11:39:26,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790925466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:26,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:26,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:39:26,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657927194] [2024-11-09 11:39:26,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:26,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:39:26,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:26,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:39:26,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:39:26,007 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:26,066 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-09 11:39:26,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:39:26,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-09 11:39:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:26,067 INFO L225 Difference]: With dead ends: 41 [2024-11-09 11:39:26,068 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 11:39:26,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:39:26,070 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:26,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 11:39:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-11-09 11:39:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-09 11:39:26,080 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 21 [2024-11-09 11:39:26,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:26,080 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-09 11:39:26,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-09 11:39:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 11:39:26,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:26,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:26,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:39:26,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:26,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:26,084 INFO L85 PathProgramCache]: Analyzing trace with hash -78246376, now seen corresponding path program 1 times [2024-11-09 11:39:26,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:26,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412064656] [2024-11-09 11:39:26,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:26,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:26,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:26,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412064656] [2024-11-09 11:39:26,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412064656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:26,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969046893] [2024-11-09 11:39:26,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:26,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:26,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:26,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:26,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:39:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:39:26,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:26,341 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 11:39:26,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:39:26,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969046893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:26,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:39:26,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-09 11:39:26,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925679492] [2024-11-09 11:39:26,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:26,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:39:26,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:26,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:39:26,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:39:26,343 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:26,390 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-09 11:39:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:39:26,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-09 11:39:26,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:26,391 INFO L225 Difference]: With dead ends: 39 [2024-11-09 11:39:26,391 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 11:39:26,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:39:26,392 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:26,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 11:39:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2024-11-09 11:39:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-09 11:39:26,397 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 21 [2024-11-09 11:39:26,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:26,397 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-09 11:39:26,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-09 11:39:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 11:39:26,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:26,398 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:26,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:39:26,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 11:39:26,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:26,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:26,604 INFO L85 PathProgramCache]: Analyzing trace with hash 654806120, now seen corresponding path program 1 times [2024-11-09 11:39:26,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:26,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672273284] [2024-11-09 11:39:26,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:26,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:26,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:26,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672273284] [2024-11-09 11:39:26,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672273284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:26,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506557598] [2024-11-09 11:39:26,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:26,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:26,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:26,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:26,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:39:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:39:26,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:26,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:26,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:26,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506557598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:26,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:26,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-09 11:39:26,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049547222] [2024-11-09 11:39:26,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:26,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:39:26,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:26,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:39:26,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:39:26,798 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:39:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:26,875 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-11-09 11:39:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:39:26,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 25 [2024-11-09 11:39:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:26,876 INFO L225 Difference]: With dead ends: 68 [2024-11-09 11:39:26,876 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 11:39:26,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:39:26,877 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:26,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 105 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 11:39:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-11-09 11:39:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-11-09 11:39:26,885 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2024-11-09 11:39:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:26,886 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-11-09 11:39:26,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:39:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-11-09 11:39:26,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:39:26,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:26,887 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:26,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:39:27,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 11:39:27,092 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:27,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:27,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1174269756, now seen corresponding path program 1 times [2024-11-09 11:39:27,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:27,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366764859] [2024-11-09 11:39:27,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:27,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:27,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:27,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366764859] [2024-11-09 11:39:27,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366764859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:27,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546103300] [2024-11-09 11:39:27,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:27,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:27,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:27,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:39:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:39:27,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:27,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:27,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546103300] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:27,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:27,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-09 11:39:27,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354145083] [2024-11-09 11:39:27,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:27,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 11:39:27,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:27,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 11:39:27,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:39:27,338 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 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 11:39:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:27,546 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2024-11-09 11:39:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 11:39:27,546 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 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 26 [2024-11-09 11:39:27,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:27,547 INFO L225 Difference]: With dead ends: 77 [2024-11-09 11:39:27,547 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 11:39:27,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-11-09 11:39:27,548 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 98 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:27,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 147 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:39:27,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 11:39:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-11-09 11:39:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:39:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-11-09 11:39:27,563 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 26 [2024-11-09 11:39:27,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:27,563 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-11-09 11:39:27,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 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 11:39:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-11-09 11:39:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 11:39:27,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:27,565 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:27,577 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 11:39:27,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:27,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:27,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:27,770 INFO L85 PathProgramCache]: Analyzing trace with hash 749470151, now seen corresponding path program 1 times [2024-11-09 11:39:27,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:27,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573205661] [2024-11-09 11:39:27,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:27,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 11:39:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:39:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 11:39:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:39:27,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:27,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573205661] [2024-11-09 11:39:27,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573205661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:27,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795636098] [2024-11-09 11:39:27,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:27,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:27,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:27,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:27,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:39:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:28,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 11:39:28,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:28,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:39:28,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795636098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:28,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:28,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-11-09 11:39:28,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121754223] [2024-11-09 11:39:28,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:28,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 11:39:28,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:28,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 11:39:28,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-11-09 11:39:28,535 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 11:39:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:29,365 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2024-11-09 11:39:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-09 11:39:29,365 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 54 [2024-11-09 11:39:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:29,366 INFO L225 Difference]: With dead ends: 223 [2024-11-09 11:39:29,367 INFO L226 Difference]: Without dead ends: 222 [2024-11-09 11:39:29,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2024-11-09 11:39:29,368 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 226 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:29,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 198 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:39:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-09 11:39:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 169. [2024-11-09 11:39:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 141 states have (on average 1.127659574468085) internal successors, (159), 141 states have internal predecessors, (159), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:39:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 187 transitions. [2024-11-09 11:39:29,385 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 187 transitions. Word has length 54 [2024-11-09 11:39:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:29,385 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 187 transitions. [2024-11-09 11:39:29,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 11:39:29,386 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 187 transitions. [2024-11-09 11:39:29,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 11:39:29,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:29,387 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:29,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:39:29,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:29,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:29,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:29,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1527022909, now seen corresponding path program 1 times [2024-11-09 11:39:29,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:29,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849903134] [2024-11-09 11:39:29,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:29,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:29,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 11:39:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:29,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 11:39:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 11:39:29,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:29,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849903134] [2024-11-09 11:39:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849903134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:29,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909665419] [2024-11-09 11:39:29,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:29,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:29,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:29,824 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:29,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:39:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:29,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:39:29,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 11:39:29,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 11:39:30,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909665419] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:30,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:30,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2024-11-09 11:39:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12524986] [2024-11-09 11:39:30,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:30,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 11:39:30,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:30,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 11:39:30,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-09 11:39:30,115 INFO L87 Difference]: Start difference. First operand 169 states and 187 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 11:39:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:30,388 INFO L93 Difference]: Finished difference Result 249 states and 281 transitions. [2024-11-09 11:39:30,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 11:39:30,389 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-11-09 11:39:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:30,390 INFO L225 Difference]: With dead ends: 249 [2024-11-09 11:39:30,390 INFO L226 Difference]: Without dead ends: 223 [2024-11-09 11:39:30,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=549, Invalid=1091, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 11:39:30,392 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 179 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:30,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 136 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:39:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-09 11:39:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 199. [2024-11-09 11:39:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 171 states have (on average 1.1403508771929824) internal successors, (195), 171 states have internal predecessors, (195), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:39:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 223 transitions. [2024-11-09 11:39:30,418 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 223 transitions. Word has length 62 [2024-11-09 11:39:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:30,418 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 223 transitions. [2024-11-09 11:39:30,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 11:39:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 223 transitions. [2024-11-09 11:39:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 11:39:30,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:30,423 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:30,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:39:30,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 11:39:30,623 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:30,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1343796701, now seen corresponding path program 2 times [2024-11-09 11:39:30,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:30,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030323373] [2024-11-09 11:39:30,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 11:39:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 11:39:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 11:39:31,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:31,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030323373] [2024-11-09 11:39:31,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030323373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:31,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557001533] [2024-11-09 11:39:31,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:39:31,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:31,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:31,047 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:31,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:39:31,107 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:39:31,108 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:39:31,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 11:39:31,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 11:39:31,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 11:39:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557001533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:31,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 46 [2024-11-09 11:39:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115858584] [2024-11-09 11:39:31,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:31,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 11:39:31,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:31,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 11:39:31,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 11:39:31,640 INFO L87 Difference]: Start difference. First operand 199 states and 223 transitions. Second operand has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 11:39:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:32,575 INFO L93 Difference]: Finished difference Result 345 states and 395 transitions. [2024-11-09 11:39:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-09 11:39:32,576 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2024-11-09 11:39:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:32,578 INFO L225 Difference]: With dead ends: 345 [2024-11-09 11:39:32,578 INFO L226 Difference]: Without dead ends: 319 [2024-11-09 11:39:32,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2529, Invalid=5303, Unknown=0, NotChecked=0, Total=7832 [2024-11-09 11:39:32,580 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 378 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:32,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 219 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:39:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-09 11:39:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 259. [2024-11-09 11:39:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 231 states have (on average 1.155844155844156) internal successors, (267), 231 states have internal predecessors, (267), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:39:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 295 transitions. [2024-11-09 11:39:32,591 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 295 transitions. Word has length 92 [2024-11-09 11:39:32,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:32,591 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 295 transitions. [2024-11-09 11:39:32,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 11:39:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 295 transitions. [2024-11-09 11:39:32,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 11:39:32,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:32,592 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:32,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 11:39:32,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:32,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:32,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1694985668, now seen corresponding path program 1 times [2024-11-09 11:39:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:32,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594156424] [2024-11-09 11:39:32,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:32,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 11:39:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:39:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:39:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:39:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 11:39:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 11:39:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 11:39:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 11:39:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-09 11:39:33,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:33,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594156424] [2024-11-09 11:39:33,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594156424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:33,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367588488] [2024-11-09 11:39:33,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:33,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:33,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:33,295 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:33,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:39:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:33,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 11:39:33,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 334 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:33,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 222 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-09 11:39:34,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367588488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:34,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:34,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2024-11-09 11:39:34,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716917937] [2024-11-09 11:39:34,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:34,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-09 11:39:34,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:34,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-09 11:39:34,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=974, Invalid=3316, Unknown=0, NotChecked=0, Total=4290 [2024-11-09 11:39:34,551 INFO L87 Difference]: Start difference. First operand 259 states and 295 transitions. Second operand has 66 states, 65 states have (on average 3.3384615384615386) internal successors, (217), 66 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2024-11-09 11:39:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:35,970 INFO L93 Difference]: Finished difference Result 643 states and 731 transitions. [2024-11-09 11:39:35,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-11-09 11:39:35,970 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.3384615384615386) internal successors, (217), 66 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) Word has length 114 [2024-11-09 11:39:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:35,973 INFO L225 Difference]: With dead ends: 643 [2024-11-09 11:39:35,973 INFO L226 Difference]: Without dead ends: 642 [2024-11-09 11:39:35,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3661 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4499, Invalid=11757, Unknown=0, NotChecked=0, Total=16256 [2024-11-09 11:39:35,977 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 539 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:35,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 312 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:39:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-09 11:39:35,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 424. [2024-11-09 11:39:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 366 states have (on average 1.139344262295082) internal successors, (417), 366 states have internal predecessors, (417), 29 states have call successors, (29), 28 states have call predecessors, (29), 28 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-09 11:39:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 475 transitions. [2024-11-09 11:39:35,993 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 475 transitions. Word has length 114 [2024-11-09 11:39:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:35,993 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 475 transitions. [2024-11-09 11:39:35,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.3384615384615386) internal successors, (217), 66 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2024-11-09 11:39:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 475 transitions. [2024-11-09 11:39:35,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-09 11:39:35,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:35,995 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:36,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 11:39:36,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:36,200 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:36,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:36,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2144432913, now seen corresponding path program 2 times [2024-11-09 11:39:36,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:36,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303376193] [2024-11-09 11:39:36,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 11:39:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:39:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 11:39:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 11:39:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 11:39:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 11:39:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 11:39:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 11:39:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 11:39:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 11:39:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-09 11:39:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-09 11:39:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-09 11:39:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-09 11:39:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-09 11:39:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-09 11:39:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-09 11:39:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-09 11:39:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 0 proven. 1140 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-09 11:39:37,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:37,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303376193] [2024-11-09 11:39:37,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303376193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:37,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384859937] [2024-11-09 11:39:37,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:39:37,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:37,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:37,683 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:37,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:39:37,782 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:39:37,782 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:39:37,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 11:39:37,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 4 proven. 1737 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:39:39,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 4 proven. 1125 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2024-11-09 11:39:41,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384859937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:41,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:41,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 40, 40] total 123 [2024-11-09 11:39:41,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525835884] [2024-11-09 11:39:41,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:41,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2024-11-09 11:39:41,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:41,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2024-11-09 11:39:41,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3657, Invalid=11595, Unknown=0, NotChecked=0, Total=15252 [2024-11-09 11:39:41,203 INFO L87 Difference]: Start difference. First operand 424 states and 475 transitions. Second operand has 124 states, 123 states have (on average 3.4552845528455283) internal successors, (425), 124 states have internal predecessors, (425), 56 states have call successors, (58), 19 states have call predecessors, (58), 19 states have return successors, (58), 56 states have call predecessors, (58), 56 states have call successors, (58) [2024-11-09 11:39:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:46,404 INFO L93 Difference]: Finished difference Result 1427 states and 1606 transitions. [2024-11-09 11:39:46,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2024-11-09 11:39:46,405 INFO L78 Accepts]: Start accepts. Automaton has has 124 states, 123 states have (on average 3.4552845528455283) internal successors, (425), 124 states have internal predecessors, (425), 56 states have call successors, (58), 19 states have call predecessors, (58), 19 states have return successors, (58), 56 states have call predecessors, (58), 56 states have call successors, (58) Word has length 229 [2024-11-09 11:39:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:46,409 INFO L225 Difference]: With dead ends: 1427 [2024-11-09 11:39:46,409 INFO L226 Difference]: Without dead ends: 1426 [2024-11-09 11:39:46,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14364 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=17824, Invalid=42938, Unknown=0, NotChecked=0, Total=60762 [2024-11-09 11:39:46,416 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1045 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:46,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 568 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 11:39:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-11-09 11:39:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 754. [2024-11-09 11:39:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 636 states have (on average 1.1273584905660377) internal successors, (717), 636 states have internal predecessors, (717), 59 states have call successors, (59), 58 states have call predecessors, (59), 58 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-09 11:39:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 835 transitions. [2024-11-09 11:39:46,458 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 835 transitions. Word has length 229 [2024-11-09 11:39:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:46,459 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 835 transitions. [2024-11-09 11:39:46,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 123 states have (on average 3.4552845528455283) internal successors, (425), 124 states have internal predecessors, (425), 56 states have call successors, (58), 19 states have call predecessors, (58), 19 states have return successors, (58), 56 states have call predecessors, (58), 56 states have call successors, (58) [2024-11-09 11:39:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 835 transitions. [2024-11-09 11:39:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-09 11:39:46,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:46,467 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 22, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:46,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 11:39:46,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 11:39:46,672 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:46,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:46,673 INFO L85 PathProgramCache]: Analyzing trace with hash -419020003, now seen corresponding path program 3 times [2024-11-09 11:39:46,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:46,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056441090] [2024-11-09 11:39:46,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:46,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 11:39:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-09 11:39:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-09 11:39:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-09 11:39:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-09 11:39:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-09 11:39:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-09 11:39:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-09 11:39:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-09 11:39:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-09 11:39:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-09 11:39:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-09 11:39:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-09 11:39:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-09 11:39:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-09 11:39:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2024-11-09 11:39:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-11-09 11:39:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-11-09 11:39:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2984 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2024-11-09 11:39:48,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:48,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056441090] [2024-11-09 11:39:48,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056441090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:48,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257803577] [2024-11-09 11:39:48,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:39:48,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:48,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:48,172 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:39:48,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 11:39:48,228 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 11:39:48,229 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:39:48,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:39:48,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2984 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 2794 trivial. 0 not checked. [2024-11-09 11:39:48,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:39:48,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257803577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:48,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:39:48,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [48] total 51 [2024-11-09 11:39:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268221671] [2024-11-09 11:39:48,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:48,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:39:48,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:48,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:39:48,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=628, Invalid=1922, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 11:39:48,312 INFO L87 Difference]: Start difference. First operand 754 states and 835 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:39:48,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:48,394 INFO L93 Difference]: Finished difference Result 762 states and 843 transitions. [2024-11-09 11:39:48,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:39:48,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 328 [2024-11-09 11:39:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:48,396 INFO L225 Difference]: With dead ends: 762 [2024-11-09 11:39:48,396 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:39:48,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=638, Invalid=2118, Unknown=0, NotChecked=0, Total=2756 [2024-11-09 11:39:48,398 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:48,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:48,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:39:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:39:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:39:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:39:48,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 328 [2024-11-09 11:39:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:48,400 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:39:48,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:39:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:39:48,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:39:48,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 11:39:48,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 11:39:48,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 11:39:48,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 11:39:48,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 11:39:48,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 11:39:48,608 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:48,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:39:54,516 WARN L286 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 434 DAG size of output: 96 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 11:39:55,359 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:39:55,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:39:55 BoogieIcfgContainer [2024-11-09 11:39:55,380 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:39:55,380 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:39:55,380 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:39:55,380 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:39:55,381 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:39:24" (3/4) ... [2024-11-09 11:39:55,386 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:39:55,391 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 11:39:55,391 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 11:39:55,395 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-09 11:39:55,395 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:39:55,395 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:39:55,396 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:39:55,475 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:39:55,475 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:39:55,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:39:55,476 INFO L158 Benchmark]: Toolchain (without parser) took 31092.20ms. Allocated memory was 190.8MB in the beginning and 1.1GB in the end (delta: 933.2MB). Free memory was 123.9MB in the beginning and 997.5MB in the end (delta: -873.6MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2024-11-09 11:39:55,477 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 119.5MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:39:55,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.05ms. Allocated memory is still 190.8MB. Free memory was 123.6MB in the beginning and 111.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:39:55,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.07ms. Allocated memory is still 190.8MB. Free memory was 111.0MB in the beginning and 109.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:39:55,477 INFO L158 Benchmark]: Boogie Preprocessor took 26.36ms. Allocated memory is still 190.8MB. Free memory was 109.6MB in the beginning and 107.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:39:55,478 INFO L158 Benchmark]: RCFGBuilder took 327.77ms. Allocated memory is still 190.8MB. Free memory was 107.8MB in the beginning and 95.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:39:55,478 INFO L158 Benchmark]: TraceAbstraction took 30378.67ms. Allocated memory was 190.8MB in the beginning and 1.1GB in the end (delta: 933.2MB). Free memory was 94.6MB in the beginning and 1.0GB in the end (delta: -908.2MB). Peak memory consumption was 494.4MB. Max. memory is 16.1GB. [2024-11-09 11:39:55,478 INFO L158 Benchmark]: Witness Printer took 95.78ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 997.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:39:55,480 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 119.5MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.05ms. Allocated memory is still 190.8MB. Free memory was 123.6MB in the beginning and 111.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.07ms. Allocated memory is still 190.8MB. Free memory was 111.0MB in the beginning and 109.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.36ms. Allocated memory is still 190.8MB. Free memory was 109.6MB in the beginning and 107.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 327.77ms. Allocated memory is still 190.8MB. Free memory was 107.8MB in the beginning and 95.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30378.67ms. Allocated memory was 190.8MB in the beginning and 1.1GB in the end (delta: 933.2MB). Free memory was 94.6MB in the beginning and 1.0GB in the end (delta: -908.2MB). Peak memory consumption was 494.4MB. Max. memory is 16.1GB. * Witness Printer took 95.78ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 997.5MB in the end (delta: 5.2MB). 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: 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: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: 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, 37 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 14, TraceHistogramMax: 23, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2602 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2602 mSDsluCounter, 2161 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1814 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1842 IncrementalHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 347 mSDtfsCounter, 1842 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2190 GetRequests, 1513 SyntacticMatches, 0 SemanticMatches, 677 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21310 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=754occurred in iteration=13, InterpolantAutomatonStates: 500, 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, 14 MinimizatonAttempts, 1055 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 1989 NumberOfCodeBlocks, 1697 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2561 ConstructedInterpolants, 0 QuantifiedInterpolants, 5301 SizeOfPredicates, 101 NumberOfNonLiveVariables, 1586 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 6456/13541 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 4 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((1 <= counter) && (counter <= 2147483629)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((1 <= counter) && (counter <= 100)) || (counter == 0)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((counter == 0) && (counter == \old(counter))) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:39:55,510 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