./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_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/divbin2_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 f26bb7c01ef96852e13a34034142a6eda53bd301e224804a84caad37f299321b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:38:52,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:38:52,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:38:52,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:38:52,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:38:52,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:38:52,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:38:52,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:38:52,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:38:52,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:38:52,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:38:52,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:38:52,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:38:52,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:38:52,702 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:38:52,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:38:52,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:38:52,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:38:52,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:38:52,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:38:52,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:38:52,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:38:52,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:38:52,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:38:52,706 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:38:52,706 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:38:52,706 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:38:52,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:38:52,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:38:52,707 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:38:52,707 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:38:52,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:38:52,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:38:52,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:38:52,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:38:52,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:38:52,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:38:52,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:38:52,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:38:52,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:38:52,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:38:52,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:38:52,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:38:52,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:38:52,713 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 -> f26bb7c01ef96852e13a34034142a6eda53bd301e224804a84caad37f299321b [2024-11-09 11:38:53,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:38:53,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:38:53,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:38:53,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:38:53,034 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:38:53,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound100.i [2024-11-09 11:38:54,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:38:54,691 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:38:54,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound100.i [2024-11-09 11:38:54,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99725597c/47581bd3efdb47f78781a18d343bc52d/FLAG9adc772f7 [2024-11-09 11:38:55,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99725597c/47581bd3efdb47f78781a18d343bc52d [2024-11-09 11:38:55,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:38:55,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:38:55,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:38:55,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:38:55,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:38:55,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f63922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55, skipping insertion in model container [2024-11-09 11:38:55,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:38:55,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:38:55,301 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:38:55,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:38:55,344 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:38:55,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55 WrapperNode [2024-11-09 11:38:55,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:38:55,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:38:55,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:38:55,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:38:55,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,379 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2024-11-09 11:38:55,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:38:55,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:38:55,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:38:55,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:38:55,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,408 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:38:55,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:38:55,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:38:55,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:38:55,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:38:55,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55" (1/1) ... [2024-11-09 11:38:55,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:38:55,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:55,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:38:55,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:38:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:38:55,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:38:55,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:38:55,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:38:55,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:38:55,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:38:55,575 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:38:55,576 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:38:55,767 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-09 11:38:55,767 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:38:55,781 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:38:55,782 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:38:55,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:38:55 BoogieIcfgContainer [2024-11-09 11:38:55,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:38:55,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:38:55,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:38:55,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:38:55,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:38:55" (1/3) ... [2024-11-09 11:38:55,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69683600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:38:55, skipping insertion in model container [2024-11-09 11:38:55,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:55" (2/3) ... [2024-11-09 11:38:55,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69683600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:38:55, skipping insertion in model container [2024-11-09 11:38:55,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:38:55" (3/3) ... [2024-11-09 11:38:55,796 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound100.i [2024-11-09 11:38:55,818 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:38:55,818 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 11:38:55,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:38:55,902 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;@177ba4c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:38:55,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 11:38:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:38:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 11:38:55,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:55,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 11:38:55,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:55,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash 925668, now seen corresponding path program 1 times [2024-11-09 11:38:55,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:55,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580937837] [2024-11-09 11:38:55,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:55,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:56,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:56,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580937837] [2024-11-09 11:38:56,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580937837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:38:56,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:38:56,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:38:56,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407111995] [2024-11-09 11:38:56,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:38:56,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:38:56,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:56,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:38:56,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:38:56,183 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:56,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:56,260 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2024-11-09 11:38:56,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:38:56,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 11:38:56,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:56,271 INFO L225 Difference]: With dead ends: 55 [2024-11-09 11:38:56,271 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 11:38:56,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:38:56,277 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:56,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 71 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:38:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 11:38:56,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2024-11-09 11:38:56,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:38:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-09 11:38:56,307 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 4 [2024-11-09 11:38:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:56,307 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-09 11:38:56,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-09 11:38:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 11:38:56,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:56,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 11:38:56,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:38:56,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:56,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:56,310 INFO L85 PathProgramCache]: Analyzing trace with hash 28695749, now seen corresponding path program 1 times [2024-11-09 11:38:56,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:56,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616914859] [2024-11-09 11:38:56,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:56,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:56,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:56,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616914859] [2024-11-09 11:38:56,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616914859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:38:56,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:38:56,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:38:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310226558] [2024-11-09 11:38:56,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:38:56,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:38:56,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:56,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:38:56,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:38:56,362 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:56,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:56,393 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-09 11:38:56,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:38:56,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 11:38:56,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:56,395 INFO L225 Difference]: With dead ends: 39 [2024-11-09 11:38:56,395 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 11:38:56,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:38:56,396 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:56,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 54 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:38:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 11:38:56,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-09 11:38:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:38:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-09 11:38:56,403 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2024-11-09 11:38:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:56,403 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-09 11:38:56,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-09 11:38:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 11:38:56,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:56,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:56,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:38:56,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:56,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1180015242, now seen corresponding path program 1 times [2024-11-09 11:38:56,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:56,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412277426] [2024-11-09 11:38:56,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:56,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:56,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:56,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412277426] [2024-11-09 11:38:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412277426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:38:56,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:38:56,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:38:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64289059] [2024-11-09 11:38:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:38:56,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:38:56,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:56,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:38:56,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:38:56,543 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:56,626 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-09 11:38:56,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:38:56,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 11:38:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:56,628 INFO L225 Difference]: With dead ends: 25 [2024-11-09 11:38:56,628 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 11:38:56,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:38:56,630 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:56,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 35 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:38:56,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 11:38:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 11:38:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:38:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-09 11:38:56,636 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2024-11-09 11:38:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:56,636 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-09 11:38:56,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-09 11:38:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 11:38:56,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:56,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:56,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:38:56,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:56,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2074233100, now seen corresponding path program 1 times [2024-11-09 11:38:56,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:56,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640909872] [2024-11-09 11:38:56,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:56,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:56,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:56,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640909872] [2024-11-09 11:38:56,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640909872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:38:56,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:38:56,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:38:56,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479924527] [2024-11-09 11:38:56,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:38:56,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:38:56,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:56,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:38:56,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:38:56,745 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:56,828 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-09 11:38:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:38:56,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 11:38:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:56,830 INFO L225 Difference]: With dead ends: 34 [2024-11-09 11:38:56,830 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 11:38:56,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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:38:56,835 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:56,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 60 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:38:56,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 11:38:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-11-09 11:38:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:38:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-09 11:38:56,846 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2024-11-09 11:38:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:56,849 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-09 11:38:56,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-09 11:38:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 11:38:56,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:56,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:56,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:38:56,851 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:56,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:56,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2074194371, now seen corresponding path program 1 times [2024-11-09 11:38:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:56,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542223273] [2024-11-09 11:38:56,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:56,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:56,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:56,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542223273] [2024-11-09 11:38:56,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542223273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:56,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162879528] [2024-11-09 11:38:56,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:56,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:56,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:56,981 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:56,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:38:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:57,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:38:57,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:57,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:38:57,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162879528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:38:57,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:38:57,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2024-11-09 11:38:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792228341] [2024-11-09 11:38:57,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:38:57,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:38:57,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:57,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:38:57,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:38:57,130 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:57,181 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-09 11:38:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:38:57,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 11:38:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:57,184 INFO L225 Difference]: With dead ends: 32 [2024-11-09 11:38:57,185 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 11:38:57,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 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:38:57,187 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:57,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:38:57,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 11:38:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-09 11:38:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:38:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-09 11:38:57,197 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2024-11-09 11:38:57,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:57,198 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-09 11:38:57,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-09 11:38:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 11:38:57,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:57,199 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:57,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:38:57,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:57,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:57,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:57,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1945618765, now seen corresponding path program 1 times [2024-11-09 11:38:57,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:57,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041724199] [2024-11-09 11:38:57,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:57,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:57,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:57,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041724199] [2024-11-09 11:38:57,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041724199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:57,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300825510] [2024-11-09 11:38:57,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:57,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:57,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:57,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:57,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:38:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:57,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:38:57,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:57,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:57,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300825510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:57,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:57,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-09 11:38:57,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688238571] [2024-11-09 11:38:57,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:57,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:38:57,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:57,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:38:57,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:38:57,601 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:57,733 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-11-09 11:38:57,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:38:57,733 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 11:38:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:57,735 INFO L225 Difference]: With dead ends: 61 [2024-11-09 11:38:57,735 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 11:38:57,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:38:57,737 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:57,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:38:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 11:38:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2024-11-09 11:38:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:38:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-09 11:38:57,751 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2024-11-09 11:38:57,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:57,752 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-09 11:38:57,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-09 11:38:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:38:57,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:57,753 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:57,772 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:38:57,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 11:38:57,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:38:57,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash 186216572, now seen corresponding path program 1 times [2024-11-09 11:38:57,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:57,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892199935] [2024-11-09 11:38:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892199935] [2024-11-09 11:38:58,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892199935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898161757] [2024-11-09 11:38:58,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:58,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:58,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:58,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:58,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:38:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:58,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:38:58,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:58,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:58,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898161757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:58,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:58,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2024-11-09 11:38:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253305921] [2024-11-09 11:38:58,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:58,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 11:38:58,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:58,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 11:38:58,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:38:58,270 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:38:58,529 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-11-09 11:38:58,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 11:38:58,529 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 11:38:58,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:38:58,530 INFO L225 Difference]: With dead ends: 70 [2024-11-09 11:38:58,530 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 11:38:58,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-11-09 11:38:58,531 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 107 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:38:58,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 123 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:38:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 11:38:58,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-11-09 11:38:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:38:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-11-09 11:38:58,545 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 15 [2024-11-09 11:38:58,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:38:58,546 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-11-09 11:38:58,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:38:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-11-09 11:38:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 11:38:58,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:38:58,547 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:38:58,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:38:58,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:58,748 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:38:58,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:38:58,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1204191181, now seen corresponding path program 1 times [2024-11-09 11:38:58,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:38:58,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013937477] [2024-11-09 11:38:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:58,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:38:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:58,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 11:38:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:58,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 11:38:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:59,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:38:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:38:59,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:38:59,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013937477] [2024-11-09 11:38:59,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013937477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:38:59,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022180673] [2024-11-09 11:38:59,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:38:59,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:38:59,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:38:59,012 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:38:59,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:38:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:38:59,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 11:38:59,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:38:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:38:59,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:38:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:38:59,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022180673] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:38:59,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:38:59,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-11-09 11:38:59,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752107869] [2024-11-09 11:38:59,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:38:59,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 11:38:59,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:38:59,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 11:38:59,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-11-09 11:38:59,532 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 11:39:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:00,196 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2024-11-09 11:39:00,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-09 11:39:00,197 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 43 [2024-11-09 11:39:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:00,199 INFO L225 Difference]: With dead ends: 216 [2024-11-09 11:39:00,199 INFO L226 Difference]: Without dead ends: 215 [2024-11-09 11:39:00,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2024-11-09 11:39:00,204 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 227 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:00,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 172 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:39:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-09 11:39:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 162. [2024-11-09 11:39:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.1313868613138687) internal successors, (155), 137 states have internal predecessors, (155), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 11:39:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 179 transitions. [2024-11-09 11:39:00,238 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 179 transitions. Word has length 43 [2024-11-09 11:39:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:00,239 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 179 transitions. [2024-11-09 11:39:00,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 11:39:00,242 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2024-11-09 11:39:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 11:39:00,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:00,244 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 11:39:00,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 11:39:00,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:00,444 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:00,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:00,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2011427467, now seen corresponding path program 1 times [2024-11-09 11:39:00,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:00,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657216293] [2024-11-09 11:39:00,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:00,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 11:39:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:00,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 11:39:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:39:00,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:00,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657216293] [2024-11-09 11:39:00,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657216293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:00,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136182884] [2024-11-09 11:39:00,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:00,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:00,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:00,673 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:00,675 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:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:00,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:39:00,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:39:00,783 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:39:00,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136182884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:00,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:00,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2024-11-09 11:39:00,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785311645] [2024-11-09 11:39:00,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:00,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 11:39:00,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:00,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 11:39:00,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-09 11:39:00,957 INFO L87 Difference]: Start difference. First operand 162 states and 179 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:01,302 INFO L93 Difference]: Finished difference Result 242 states and 273 transitions. [2024-11-09 11:39:01,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 11:39:01,303 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2024-11-09 11:39:01,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:01,304 INFO L225 Difference]: With dead ends: 242 [2024-11-09 11:39:01,304 INFO L226 Difference]: Without dead ends: 216 [2024-11-09 11:39:01,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 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:01,306 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 114 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:01,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 97 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:39:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-09 11:39:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 192. [2024-11-09 11:39:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 167 states have (on average 1.1437125748502994) internal successors, (191), 167 states have internal predecessors, (191), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 11:39:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 215 transitions. [2024-11-09 11:39:01,334 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 215 transitions. Word has length 51 [2024-11-09 11:39:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:01,334 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 215 transitions. [2024-11-09 11:39:01,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 215 transitions. [2024-11-09 11:39:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 11:39:01,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:01,344 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 11:39:01,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 11:39:01,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:01,545 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:01,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:01,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1375833717, now seen corresponding path program 2 times [2024-11-09 11:39:01,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:01,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131013442] [2024-11-09 11:39:01,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:01,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:02,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:39:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:02,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 11:39:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:39:02,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:02,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131013442] [2024-11-09 11:39:02,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131013442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:02,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124340615] [2024-11-09 11:39:02,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:39:02,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:02,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:02,121 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:02,123 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:02,184 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:39:02,184 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:39:02,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 11:39:02,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:39:02,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:39:02,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124340615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:02,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:02,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 46 [2024-11-09 11:39:02,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790470628] [2024-11-09 11:39:02,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:02,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 11:39:02,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:02,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 11:39:02,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 11:39:02,882 INFO L87 Difference]: Start difference. First operand 192 states and 215 transitions. Second operand has 46 states, 46 states have (on average 2.717391304347826) internal successors, (125), 46 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:04,082 INFO L93 Difference]: Finished difference Result 338 states and 387 transitions. [2024-11-09 11:39:04,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-09 11:39:04,083 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.717391304347826) internal successors, (125), 46 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-11-09 11:39:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:04,085 INFO L225 Difference]: With dead ends: 338 [2024-11-09 11:39:04,085 INFO L226 Difference]: Without dead ends: 312 [2024-11-09 11:39:04,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2529, Invalid=5303, Unknown=0, NotChecked=0, Total=7832 [2024-11-09 11:39:04,088 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 360 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:04,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 191 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:39:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-09 11:39:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 252. [2024-11-09 11:39:04,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 227 states have (on average 1.158590308370044) internal successors, (263), 227 states have internal predecessors, (263), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 11:39:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 287 transitions. [2024-11-09 11:39:04,108 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 287 transitions. Word has length 81 [2024-11-09 11:39:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:04,109 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 287 transitions. [2024-11-09 11:39:04,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.717391304347826) internal successors, (125), 46 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 287 transitions. [2024-11-09 11:39:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 11:39:04,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:04,114 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 11:39:04,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:39:04,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:04,315 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:04,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:04,315 INFO L85 PathProgramCache]: Analyzing trace with hash -55266820, now seen corresponding path program 1 times [2024-11-09 11:39:04,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:04,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241639253] [2024-11-09 11:39:04,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:04,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:04,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 11:39:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:04,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 11:39:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:39:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:04,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:39:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:04,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:39:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:04,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 11:39:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:04,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 11:39:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:04,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 11:39:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 11:39:04,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:04,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241639253] [2024-11-09 11:39:04,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241639253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859483885] [2024-11-09 11:39:04,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:04,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:04,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:04,921 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:04,922 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:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:04,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 11:39:04,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 3 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:39:05,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 3 proven. 222 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 11:39:06,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859483885] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:06,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:06,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2024-11-09 11:39:06,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442335928] [2024-11-09 11:39:06,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:06,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-09 11:39:06,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:06,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-09 11:39:06,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=974, Invalid=3316, Unknown=0, NotChecked=0, Total=4290 [2024-11-09 11:39:06,489 INFO L87 Difference]: Start difference. First operand 252 states and 287 transitions. Second operand has 66 states, 65 states have (on average 3.2615384615384615) internal successors, (212), 66 states have internal predecessors, (212), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 11:39:08,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:08,486 INFO L93 Difference]: Finished difference Result 636 states and 723 transitions. [2024-11-09 11:39:08,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-11-09 11:39:08,487 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.2615384615384615) internal successors, (212), 66 states have internal predecessors, (212), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Word has length 103 [2024-11-09 11:39:08,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:08,494 INFO L225 Difference]: With dead ends: 636 [2024-11-09 11:39:08,495 INFO L226 Difference]: Without dead ends: 635 [2024-11-09 11:39:08,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3661 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4499, Invalid=11757, Unknown=0, NotChecked=0, Total=16256 [2024-11-09 11:39:08,501 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 576 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:08,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 288 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:39:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-09 11:39:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 417. [2024-11-09 11:39:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 362 states have (on average 1.1408839779005524) internal successors, (413), 362 states have internal predecessors, (413), 27 states have call successors, (27), 27 states have call predecessors, (27), 27 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 11:39:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 467 transitions. [2024-11-09 11:39:08,533 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 467 transitions. Word has length 103 [2024-11-09 11:39:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:08,534 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 467 transitions. [2024-11-09 11:39:08,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.2615384615384615) internal successors, (212), 66 states have internal predecessors, (212), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 11:39:08,534 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 467 transitions. [2024-11-09 11:39:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-09 11:39:08,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:08,538 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2024-11-09 11:39:08,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:39:08,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:08,739 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:08,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:08,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2010681684, now seen corresponding path program 2 times [2024-11-09 11:39:08,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:08,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676275002] [2024-11-09 11:39:08,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:08,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 11:39:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 11:39:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:39:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 11:39:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 11:39:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 11:39:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 11:39:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 11:39:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 11:39:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 11:39:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 11:39:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-09 11:39:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-09 11:39:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-09 11:39:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-09 11:39:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-09 11:39:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-09 11:39:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-09 11:39:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 1140 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 11:39:10,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:10,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676275002] [2024-11-09 11:39:10,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676275002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:10,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108334904] [2024-11-09 11:39:10,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:39:10,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:10,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:10,717 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:10,718 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:10,834 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:39:10,834 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:39:10,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 11:39:10,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 1752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:39:11,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 1140 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 11:39:12,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108334904] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:12,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:12,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 45] total 89 [2024-11-09 11:39:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475588265] [2024-11-09 11:39:12,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:12,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2024-11-09 11:39:12,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:12,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2024-11-09 11:39:12,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1841, Invalid=6169, Unknown=0, NotChecked=0, Total=8010 [2024-11-09 11:39:12,826 INFO L87 Difference]: Start difference. First operand 417 states and 467 transitions. Second operand has 90 states, 89 states have (on average 3.5168539325842696) internal successors, (313), 90 states have internal predecessors, (313), 36 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 36 states have call predecessors, (54), 36 states have call successors, (54) [2024-11-09 11:39:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:15,702 INFO L93 Difference]: Finished difference Result 1217 states and 1357 transitions. [2024-11-09 11:39:15,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2024-11-09 11:39:15,703 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 89 states have (on average 3.5168539325842696) internal successors, (313), 90 states have internal predecessors, (313), 36 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 36 states have call predecessors, (54), 36 states have call successors, (54) Word has length 218 [2024-11-09 11:39:15,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:15,709 INFO L225 Difference]: With dead ends: 1217 [2024-11-09 11:39:15,710 INFO L226 Difference]: Without dead ends: 1216 [2024-11-09 11:39:15,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8594 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=9010, Invalid=23932, Unknown=0, NotChecked=0, Total=32942 [2024-11-09 11:39:15,718 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 813 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:15,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 373 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:39:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-09 11:39:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 538. [2024-11-09 11:39:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 461 states have (on average 1.1344902386117137) internal successors, (523), 461 states have internal predecessors, (523), 38 states have call successors, (38), 38 states have call predecessors, (38), 38 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 11:39:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 599 transitions. [2024-11-09 11:39:15,758 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 599 transitions. Word has length 218 [2024-11-09 11:39:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:15,759 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 599 transitions. [2024-11-09 11:39:15,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 89 states have (on average 3.5168539325842696) internal successors, (313), 90 states have internal predecessors, (313), 36 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 36 states have call predecessors, (54), 36 states have call successors, (54) [2024-11-09 11:39:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 599 transitions. [2024-11-09 11:39:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-09 11:39:15,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:15,762 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2024-11-09 11:39:15,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 11:39:15,963 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,SelfDestructingSolverStorable11 [2024-11-09 11:39:15,963 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:15,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:15,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1406495045, now seen corresponding path program 3 times [2024-11-09 11:39:15,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:15,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027210016] [2024-11-09 11:39:15,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:15,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:39:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 11:39:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:39:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 11:39:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 11:39:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 11:39:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:39:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 11:39:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 11:39:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 11:39:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-09 11:39:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-09 11:39:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-09 11:39:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-09 11:39:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-09 11:39:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-09 11:39:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-09 11:39:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-09 11:39:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-09 11:39:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1968 backedges. 0 proven. 1284 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 11:39:17,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:17,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027210016] [2024-11-09 11:39:17,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027210016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:17,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394633973] [2024-11-09 11:39:17,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:39:17,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:17,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:17,856 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:17,858 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:17,915 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 11:39:17,916 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:39:17,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:39:17,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1968 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2024-11-09 11:39:18,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:39:18,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394633973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:18,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:39:18,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [49] total 52 [2024-11-09 11:39:18,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960100868] [2024-11-09 11:39:18,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:18,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:39:18,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:18,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:39:18,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=2137, Unknown=0, NotChecked=0, Total=2756 [2024-11-09 11:39:18,032 INFO L87 Difference]: Start difference. First operand 538 states and 599 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:39:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:18,136 INFO L93 Difference]: Finished difference Result 546 states and 607 transitions. [2024-11-09 11:39:18,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:39:18,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 234 [2024-11-09 11:39:18,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:18,137 INFO L225 Difference]: With dead ends: 546 [2024-11-09 11:39:18,137 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:39:18,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=629, Invalid=2341, Unknown=0, NotChecked=0, Total=2970 [2024-11-09 11:39:18,140 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:18,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 48 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:39:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:39:18,144 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:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:39:18,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 234 [2024-11-09 11:39:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:18,145 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:39:18,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:39:18,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:39:18,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:39:18,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 11:39:18,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 11:39:18,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 11:39:18,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 11:39:18,167 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:18,350 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,SelfDestructingSolverStorable12 [2024-11-09 11:39:18,354 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:18,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:39:27,019 WARN L286 SmtUtils]: Spent 8.66s on a formula simplification. DAG size of input: 395 DAG size of output: 114 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 11:39:28,094 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:39:28,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:39:28 BoogieIcfgContainer [2024-11-09 11:39:28,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:39:28,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:39:28,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:39:28,115 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:39:28,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:38:55" (3/4) ... [2024-11-09 11:39:28,118 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:39:28,122 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 11:39:28,125 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-09 11:39:28,125 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:39:28,125 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:39:28,125 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:39:28,214 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:39:28,214 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:39:28,215 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:39:28,215 INFO L158 Benchmark]: Toolchain (without parser) took 33172.50ms. Allocated memory was 155.2MB in the beginning and 677.4MB in the end (delta: 522.2MB). Free memory was 125.7MB in the beginning and 536.9MB in the end (delta: -411.2MB). Peak memory consumption was 109.6MB. Max. memory is 16.1GB. [2024-11-09 11:39:28,216 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory was 121.9MB in the beginning and 121.7MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:39:28,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.75ms. Allocated memory is still 155.2MB. Free memory was 125.7MB in the beginning and 112.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:39:28,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.62ms. Allocated memory is still 155.2MB. Free memory was 112.3MB in the beginning and 111.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:39:28,217 INFO L158 Benchmark]: Boogie Preprocessor took 44.29ms. Allocated memory is still 155.2MB. Free memory was 111.0MB in the beginning and 108.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:39:28,217 INFO L158 Benchmark]: RCFGBuilder took 356.10ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 121.7MB in the end (delta: -12.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 11:39:28,217 INFO L158 Benchmark]: TraceAbstraction took 32328.99ms. Allocated memory was 155.2MB in the beginning and 677.4MB in the end (delta: 522.2MB). Free memory was 120.9MB in the beginning and 542.1MB in the end (delta: -421.2MB). Peak memory consumption was 408.0MB. Max. memory is 16.1GB. [2024-11-09 11:39:28,218 INFO L158 Benchmark]: Witness Printer took 99.77ms. Allocated memory is still 677.4MB. Free memory was 542.1MB in the beginning and 536.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:39:28,220 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory was 121.9MB in the beginning and 121.7MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.75ms. Allocated memory is still 155.2MB. Free memory was 125.7MB in the beginning and 112.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.62ms. Allocated memory is still 155.2MB. Free memory was 112.3MB in the beginning and 111.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.29ms. Allocated memory is still 155.2MB. Free memory was 111.0MB in the beginning and 108.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.10ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 121.7MB in the end (delta: -12.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 32328.99ms. Allocated memory was 155.2MB in the beginning and 677.4MB in the end (delta: 522.2MB). Free memory was 120.9MB in the beginning and 542.1MB in the end (delta: -421.2MB). Peak memory consumption was 408.0MB. Max. memory is 16.1GB. * Witness Printer took 99.77ms. Allocated memory is still 677.4MB. Free memory was 542.1MB in the beginning and 536.9MB 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: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 22.5s, OverallIterations: 13, TraceHistogramMax: 20, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2295 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2295 mSDsluCounter, 1653 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1442 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1645 IncrementalHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 211 mSDtfsCounter, 1645 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1843 GetRequests, 1229 SyntacticMatches, 0 SemanticMatches, 614 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15609 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=538occurred in iteration=12, InterpolantAutomatonStates: 450, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 1061 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 1566 NumberOfCodeBlocks, 1358 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2062 ConstructedInterpolants, 0 QuantifiedInterpolants, 4774 SizeOfPredicates, 107 NumberOfNonLiveVariables, 1298 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 4241/11397 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: 34]: Loop Invariant Derived loop invariant: (((1 <= counter) && (counter <= 100)) || (counter == 0)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((1 <= counter) && (counter <= 2147483629)) - 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:28,253 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