./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.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 d7b32f819b918e072cd2f6b8ef11cf08c33c51198307cb8de75af009db97bd7b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:35:11,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:35:12,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:35:12,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:35:12,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:35:12,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:35:12,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:35:12,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:35:12,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:35:12,059 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:35:12,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:35:12,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:35:12,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:35:12,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:35:12,061 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:35:12,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:35:12,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:35:12,063 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:35:12,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:35:12,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:35:12,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:35:12,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:35:12,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:35:12,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:35:12,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:35:12,068 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:35:12,068 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:35:12,069 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:35:12,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:35:12,069 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:35:12,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:35:12,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:35:12,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:35:12,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:35:12,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:35:12,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:35:12,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:35:12,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:35:12,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:35:12,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:35:12,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:35:12,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:35:12,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:35:12,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:35:12,075 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 -> d7b32f819b918e072cd2f6b8ef11cf08c33c51198307cb8de75af009db97bd7b [2024-11-19 10:35:12,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:35:12,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:35:12,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:35:12,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:35:12,397 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:35:12,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.i [2024-11-19 10:35:13,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:35:14,008 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:35:14,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.i [2024-11-19 10:35:14,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6161a5564/28fc878e80f6480bb4dbdba026a19f1d/FLAGcd00e1041 [2024-11-19 10:35:14,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6161a5564/28fc878e80f6480bb4dbdba026a19f1d [2024-11-19 10:35:14,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:35:14,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:35:14,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:35:14,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:35:14,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:35:14,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c39c0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14, skipping insertion in model container [2024-11-19 10:35:14,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:35:14,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:35:14,623 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:35:14,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:35:14,660 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:35:14,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14 WrapperNode [2024-11-19 10:35:14,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:35:14,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:35:14,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:35:14,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:35:14,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,697 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2024-11-19 10:35:14,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:35:14,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:35:14,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:35:14,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:35:14,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,736 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-19 10:35:14,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:35:14,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:35:14,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:35:14,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:35:14,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14" (1/1) ... [2024-11-19 10:35:14,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:35:14,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:14,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 10:35:14,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 10:35:14,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:35:14,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:35:14,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:35:14,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:35:14,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 10:35:14,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 10:35:14,928 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:35:14,930 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:35:15,158 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-19 10:35:15,158 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:35:15,178 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:35:15,179 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 10:35:15,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:35:15 BoogieIcfgContainer [2024-11-19 10:35:15,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:35:15,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:35:15,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:35:15,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:35:15,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:35:14" (1/3) ... [2024-11-19 10:35:15,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e51664c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:35:15, skipping insertion in model container [2024-11-19 10:35:15,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:35:14" (2/3) ... [2024-11-19 10:35:15,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e51664c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:35:15, skipping insertion in model container [2024-11-19 10:35:15,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:35:15" (3/3) ... [2024-11-19 10:35:15,189 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound10.i [2024-11-19 10:35:15,205 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:35:15,205 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 10:35:15,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:35:15,270 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;@79819a57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:35:15,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 10:35:15,274 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-19 10:35:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 10:35:15,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:15,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 10:35:15,281 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-19 10:35:15,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash 925668, now seen corresponding path program 1 times [2024-11-19 10:35:15,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:15,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132884586] [2024-11-19 10:35:15,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:35:15,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:15,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132884586] [2024-11-19 10:35:15,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132884586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:15,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:15,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:35:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844019309] [2024-11-19 10:35:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:15,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:35:15,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:15,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:35:15,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:35:15,497 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-19 10:35:15,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:15,560 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2024-11-19 10:35:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:35:15,564 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-19 10:35:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:15,569 INFO L225 Difference]: With dead ends: 55 [2024-11-19 10:35:15,570 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 10:35:15,572 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-19 10:35:15,577 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-19 10:35:15,578 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-19 10:35:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 10:35:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2024-11-19 10:35:15,606 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-19 10:35:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-19 10:35:15,608 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 4 [2024-11-19 10:35:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:15,608 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-19 10:35:15,609 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-19 10:35:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-19 10:35:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 10:35:15,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:15,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 10:35:15,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:35:15,610 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-19 10:35:15,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:15,610 INFO L85 PathProgramCache]: Analyzing trace with hash 28695749, now seen corresponding path program 1 times [2024-11-19 10:35:15,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:15,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361486061] [2024-11-19 10:35:15,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:15,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:35:15,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:15,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361486061] [2024-11-19 10:35:15,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361486061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:15,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:15,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:35:15,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496020441] [2024-11-19 10:35:15,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:15,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:35:15,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:15,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:35:15,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:35:15,680 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-19 10:35:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:15,716 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-19 10:35:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:35:15,717 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-19 10:35:15,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:15,718 INFO L225 Difference]: With dead ends: 39 [2024-11-19 10:35:15,718 INFO L226 Difference]: Without dead ends: 25 [2024-11-19 10:35:15,719 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-19 10:35:15,720 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-19 10:35:15,720 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-19 10:35:15,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-19 10:35:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-19 10:35:15,730 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-19 10:35:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-19 10:35:15,732 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2024-11-19 10:35:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:15,732 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-19 10:35:15,733 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-19 10:35:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-19 10:35:15,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:35:15,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:15,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:15,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:35:15,734 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-19 10:35:15,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1180015242, now seen corresponding path program 1 times [2024-11-19 10:35:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:15,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324362225] [2024-11-19 10:35:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:35:15,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:15,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324362225] [2024-11-19 10:35:15,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324362225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:15,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:15,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:35:15,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904100973] [2024-11-19 10:35:15,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:15,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:35:15,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:15,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:35:15,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:35:15,893 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-19 10:35:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:15,977 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-19 10:35:15,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:35:15,978 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-19 10:35:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:15,980 INFO L225 Difference]: With dead ends: 25 [2024-11-19 10:35:15,980 INFO L226 Difference]: Without dead ends: 24 [2024-11-19 10:35:15,981 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-19 10:35:15,983 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-19 10:35:15,986 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-19 10:35:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-19 10:35:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-19 10:35:15,994 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-19 10:35:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-19 10:35:15,995 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2024-11-19 10:35:15,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:15,995 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-19 10:35:15,995 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-19 10:35:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-19 10:35:15,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 10:35:15,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:15,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:15,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:35:15,996 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-19 10:35:15,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:15,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2074233100, now seen corresponding path program 1 times [2024-11-19 10:35:15,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:16,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590704442] [2024-11-19 10:35:16,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:16,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:35:16,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:16,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590704442] [2024-11-19 10:35:16,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590704442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:16,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:16,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:35:16,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232729889] [2024-11-19 10:35:16,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:16,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:35:16,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:16,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:35:16,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:35:16,135 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-19 10:35:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:16,224 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-19 10:35:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:35:16,225 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-19 10:35:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:16,226 INFO L225 Difference]: With dead ends: 34 [2024-11-19 10:35:16,227 INFO L226 Difference]: Without dead ends: 33 [2024-11-19 10:35:16,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:35:16,229 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-19 10:35:16,232 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-19 10:35:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-19 10:35:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-11-19 10:35:16,239 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-19 10:35:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-19 10:35:16,240 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2024-11-19 10:35:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:16,240 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-19 10:35:16,240 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-19 10:35:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-19 10:35:16,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 10:35:16,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:16,241 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:16,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:35:16,242 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-19 10:35:16,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:16,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2074194371, now seen corresponding path program 1 times [2024-11-19 10:35:16,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:16,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874478894] [2024-11-19 10:35:16,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:16,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:35:16,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:16,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874478894] [2024-11-19 10:35:16,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874478894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:16,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103746104] [2024-11-19 10:35:16,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:16,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:16,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:16,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:35:16,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:35:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:16,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:35:16,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:35:16,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:35:16,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103746104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:16,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:35:16,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2024-11-19 10:35:16,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855713030] [2024-11-19 10:35:16,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:16,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:35:16,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:16,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:35:16,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:35:16,493 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-19 10:35:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:16,563 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-19 10:35:16,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:35:16,564 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-19 10:35:16,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:16,564 INFO L225 Difference]: With dead ends: 32 [2024-11-19 10:35:16,565 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 10:35:16,565 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-19 10:35:16,566 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-19 10:35:16,566 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-19 10:35:16,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 10:35:16,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-19 10:35:16,572 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-19 10:35:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-19 10:35:16,573 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2024-11-19 10:35:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:16,573 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-19 10:35:16,573 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-19 10:35:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-19 10:35:16,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:35:16,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:16,574 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:16,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:35:16,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:16,775 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-19 10:35:16,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:16,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1945618765, now seen corresponding path program 1 times [2024-11-19 10:35:16,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:16,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537646655] [2024-11-19 10:35:16,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:16,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:35:16,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:16,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537646655] [2024-11-19 10:35:16,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537646655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:16,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60623415] [2024-11-19 10:35:16,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:16,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:16,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:16,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:35:16,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 10:35:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:16,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:35:16,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:35:16,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:35:17,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60623415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:17,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:17,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-19 10:35:17,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081161749] [2024-11-19 10:35:17,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:17,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:35:17,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:17,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:35:17,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:35:17,022 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-19 10:35:17,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:17,202 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-11-19 10:35:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 10:35:17,203 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-19 10:35:17,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:17,204 INFO L225 Difference]: With dead ends: 61 [2024-11-19 10:35:17,204 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 10:35:17,205 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-19 10:35:17,205 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-19 10:35:17,206 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-19 10:35:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 10:35:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2024-11-19 10:35:17,218 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-19 10:35:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-19 10:35:17,221 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2024-11-19 10:35:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:17,222 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-19 10:35:17,222 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-19 10:35:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-19 10:35:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:35:17,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:17,223 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:17,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 10:35:17,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 10:35:17,424 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-19 10:35:17,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:17,425 INFO L85 PathProgramCache]: Analyzing trace with hash 186216572, now seen corresponding path program 1 times [2024-11-19 10:35:17,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:17,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901659381] [2024-11-19 10:35:17,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:17,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:17,550 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-19 10:35:17,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:17,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901659381] [2024-11-19 10:35:17,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901659381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:17,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651469229] [2024-11-19 10:35:17,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:17,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:17,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:17,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:35:17,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 10:35:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:17,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 10:35:17,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:17,675 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-19 10:35:17,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:17,794 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-19 10:35:17,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651469229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:17,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:17,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2024-11-19 10:35:17,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314591987] [2024-11-19 10:35:17,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:17,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 10:35:17,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:17,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 10:35:17,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-19 10:35:17,799 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-19 10:35:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:18,087 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-11-19 10:35:18,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 10:35:18,087 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-19 10:35:18,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:18,088 INFO L225 Difference]: With dead ends: 70 [2024-11-19 10:35:18,089 INFO L226 Difference]: Without dead ends: 69 [2024-11-19 10:35:18,089 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-19 10:35:18,090 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-19 10:35:18,090 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-19 10:35:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-19 10:35:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-11-19 10:35:18,098 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-19 10:35:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-11-19 10:35:18,099 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 15 [2024-11-19 10:35:18,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:18,099 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-11-19 10:35:18,099 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-19 10:35:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-11-19 10:35:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 10:35:18,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:18,101 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-19 10:35:18,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 10:35:18,302 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-19 10:35:18,302 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-19 10:35:18,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:18,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1204191181, now seen corresponding path program 1 times [2024-11-19 10:35:18,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:18,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382335599] [2024-11-19 10:35:18,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:18,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:18,827 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-19 10:35:18,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:18,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382335599] [2024-11-19 10:35:18,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382335599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:18,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352273217] [2024-11-19 10:35:18,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:18,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:18,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:18,830 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:35:18,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 10:35:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:18,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 10:35:18,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:19,186 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-19 10:35:19,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:19,492 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-19 10:35:19,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352273217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:19,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:19,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-11-19 10:35:19,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204831324] [2024-11-19 10:35:19,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:19,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-19 10:35:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:19,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-19 10:35:19,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-11-19 10:35:19,499 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-19 10:35:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:20,125 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2024-11-19 10:35:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-19 10:35:20,126 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-19 10:35:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:20,128 INFO L225 Difference]: With dead ends: 216 [2024-11-19 10:35:20,128 INFO L226 Difference]: Without dead ends: 215 [2024-11-19 10:35:20,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2024-11-19 10:35:20,131 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 151 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:20,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 204 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:35:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-19 10:35:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 162. [2024-11-19 10:35:20,152 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-19 10:35:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 179 transitions. [2024-11-19 10:35:20,156 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 179 transitions. Word has length 43 [2024-11-19 10:35:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:20,157 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 179 transitions. [2024-11-19 10:35:20,157 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-19 10:35:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2024-11-19 10:35:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 10:35:20,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:20,160 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-19 10:35:20,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 10:35:20,364 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-19 10:35:20,365 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-19 10:35:20,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:20,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2011427467, now seen corresponding path program 1 times [2024-11-19 10:35:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977232099] [2024-11-19 10:35:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:20,557 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-19 10:35:20,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:20,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977232099] [2024-11-19 10:35:20,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977232099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:20,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835536488] [2024-11-19 10:35:20,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:20,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:20,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:20,560 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:35:20,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 10:35:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:20,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 10:35:20,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:20,671 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-19 10:35:20,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:20,862 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-19 10:35:20,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835536488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:20,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:20,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2024-11-19 10:35:20,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237437256] [2024-11-19 10:35:20,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:20,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 10:35:20,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:20,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 10:35:20,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-19 10:35:20,865 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-19 10:35:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:21,213 INFO L93 Difference]: Finished difference Result 242 states and 273 transitions. [2024-11-19 10:35:21,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-19 10:35:21,213 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-19 10:35:21,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:21,214 INFO L225 Difference]: With dead ends: 242 [2024-11-19 10:35:21,215 INFO L226 Difference]: Without dead ends: 216 [2024-11-19 10:35:21,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 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-19 10:35:21,216 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 87 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:21,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 151 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:35:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-19 10:35:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 192. [2024-11-19 10:35:21,231 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-19 10:35:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 215 transitions. [2024-11-19 10:35:21,233 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 215 transitions. Word has length 51 [2024-11-19 10:35:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:21,233 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 215 transitions. [2024-11-19 10:35:21,234 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-19 10:35:21,234 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 215 transitions. [2024-11-19 10:35:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 10:35:21,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:21,236 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-19 10:35:21,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 10:35:21,437 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-19 10:35:21,437 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-19 10:35:21,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1375833717, now seen corresponding path program 2 times [2024-11-19 10:35:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:21,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534002337] [2024-11-19 10:35:21,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:35:21,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:21,461 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:35:21,461 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:35:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-19 10:35:21,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:21,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534002337] [2024-11-19 10:35:21,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534002337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:21,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:21,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:35:21,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697123015] [2024-11-19 10:35:21,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:21,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:35:21,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:21,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:35:21,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:35:21,533 INFO L87 Difference]: Start difference. First operand 192 states and 215 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:35:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:21,567 INFO L93 Difference]: Finished difference Result 218 states and 243 transitions. [2024-11-19 10:35:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:35:21,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2024-11-19 10:35:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:21,569 INFO L225 Difference]: With dead ends: 218 [2024-11-19 10:35:21,570 INFO L226 Difference]: Without dead ends: 192 [2024-11-19 10:35:21,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:35:21,571 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:21,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 62 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:35:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-19 10:35:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 148. [2024-11-19 10:35:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.1219512195121952) internal successors, (138), 123 states have internal predecessors, (138), 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-19 10:35:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2024-11-19 10:35:21,597 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 81 [2024-11-19 10:35:21,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:21,598 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2024-11-19 10:35:21,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:35:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2024-11-19 10:35:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 10:35:21,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:21,600 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-19 10:35:21,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:35:21,601 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-19 10:35:21,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash -55266820, now seen corresponding path program 1 times [2024-11-19 10:35:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:21,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859446829] [2024-11-19 10:35:21,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:22,265 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-19 10:35:22,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:22,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859446829] [2024-11-19 10:35:22,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859446829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:22,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081503678] [2024-11-19 10:35:22,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:22,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:22,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:22,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:35:22,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 10:35:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:22,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 10:35:22,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:22,959 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-19 10:35:22,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:23,860 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-19 10:35:23,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081503678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:23,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:23,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 64 [2024-11-19 10:35:23,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948117782] [2024-11-19 10:35:23,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:23,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-19 10:35:23,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:23,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-19 10:35:23,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=941, Invalid=3219, Unknown=0, NotChecked=0, Total=4160 [2024-11-19 10:35:23,866 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 65 states, 64 states have (on average 3.3125) internal successors, (212), 65 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-19 10:35:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:25,893 INFO L93 Difference]: Finished difference Result 526 states and 592 transitions. [2024-11-19 10:35:25,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-11-19 10:35:25,893 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 3.3125) internal successors, (212), 65 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-19 10:35:25,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:25,898 INFO L225 Difference]: With dead ends: 526 [2024-11-19 10:35:25,898 INFO L226 Difference]: Without dead ends: 525 [2024-11-19 10:35:25,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3530 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4347, Invalid=11403, Unknown=0, NotChecked=0, Total=15750 [2024-11-19 10:35:25,905 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 428 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:25,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 301 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:35:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-19 10:35:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 318. [2024-11-19 10:35:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 263 states have (on average 1.11787072243346) internal successors, (294), 263 states have internal predecessors, (294), 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-19 10:35:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 348 transitions. [2024-11-19 10:35:25,933 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 348 transitions. Word has length 103 [2024-11-19 10:35:25,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:25,934 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 348 transitions. [2024-11-19 10:35:25,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 3.3125) internal successors, (212), 65 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-19 10:35:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 348 transitions. [2024-11-19 10:35:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-19 10:35:25,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:25,940 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2024-11-19 10:35:25,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 10:35:26,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:26,142 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-19 10:35:26,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1847060531, now seen corresponding path program 2 times [2024-11-19 10:35:26,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:26,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104638966] [2024-11-19 10:35:26,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:35:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:26,226 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:35:26,226 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:35:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 1824 trivial. 0 not checked. [2024-11-19 10:35:26,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:26,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104638966] [2024-11-19 10:35:26,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104638966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:26,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:26,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:35:26,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581013729] [2024-11-19 10:35:26,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:26,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:35:26,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:26,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:35:26,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:35:26,546 INFO L87 Difference]: Start difference. First operand 318 states and 348 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:35:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:26,605 INFO L93 Difference]: Finished difference Result 322 states and 352 transitions. [2024-11-19 10:35:26,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:35:26,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 229 [2024-11-19 10:35:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:26,607 INFO L225 Difference]: With dead ends: 322 [2024-11-19 10:35:26,607 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:35:26,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:35:26,611 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:26,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 47 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:35:26,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:35:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:35:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:35:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:35:26,613 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 229 [2024-11-19 10:35:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:26,613 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:35:26,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:35:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:35:26,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:35:26,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-19 10:35:26,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-19 10:35:26,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-19 10:35:26,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-19 10:35:26,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 10:35:26,622 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:26,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:35:27,281 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:35:27,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:35:27 BoogieIcfgContainer [2024-11-19 10:35:27,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:35:27,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:35:27,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:35:27,305 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:35:27,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:35:15" (3/4) ... [2024-11-19 10:35:27,308 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:35:27,312 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-19 10:35:27,315 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-19 10:35:27,316 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 10:35:27,316 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 10:35:27,316 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:35:27,409 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:35:27,411 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:35:27,411 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:35:27,412 INFO L158 Benchmark]: Toolchain (without parser) took 13006.99ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 119.2MB in the beginning and 102.0MB in the end (delta: 17.2MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,412 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 96.5MB. Free memory was 59.9MB in the beginning and 59.8MB in the end (delta: 79.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.30ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 106.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.37ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 105.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:35:27,413 INFO L158 Benchmark]: Boogie Preprocessor took 55.65ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 103.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,417 INFO L158 Benchmark]: RCFGBuilder took 423.93ms. Allocated memory is still 167.8MB. Free memory was 103.2MB in the beginning and 135.2MB in the end (delta: -32.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,418 INFO L158 Benchmark]: TraceAbstraction took 12123.38ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 134.1MB in the beginning and 106.2MB in the end (delta: 27.9MB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,418 INFO L158 Benchmark]: Witness Printer took 106.42ms. Allocated memory is still 203.4MB. Free memory was 106.2MB in the beginning and 102.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,419 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 96.5MB. Free memory was 59.9MB in the beginning and 59.8MB in the end (delta: 79.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.30ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 106.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.37ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 105.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.65ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 103.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 423.93ms. Allocated memory is still 167.8MB. Free memory was 103.2MB in the beginning and 135.2MB in the end (delta: -32.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12123.38ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 134.1MB in the beginning and 106.2MB in the end (delta: 27.9MB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. * Witness Printer took 106.42ms. Allocated memory is still 203.4MB. Free memory was 106.2MB in the beginning and 102.0MB in the end (delta: 4.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: 11.4s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 876 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 876 mSDsluCounter, 1249 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1048 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1020 IncrementalHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 201 mSDtfsCounter, 1020 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 674 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4605 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=11, InterpolantAutomatonStates: 246, 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, 12 MinimizatonAttempts, 356 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 810 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1013 ConstructedInterpolants, 0 QuantifiedInterpolants, 2071 SizeOfPredicates, 42 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 2549/3594 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: (((counter <= 10) && (1 <= counter)) || (counter == 0)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((counter <= 10) && (1 <= counter)) || ((11 <= counter) && (counter <= 2147483645))) - 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-19 10:35:27,451 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