./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-1.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/bitvector/byte_add_2-1.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 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:03:44,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:03:44,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:03:44,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:03:44,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:03:44,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:03:44,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:03:44,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:03:44,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:03:44,484 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:03:44,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:03:44,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:03:44,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:03:44,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:03:44,490 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:03:44,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:03:44,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:03:44,491 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:03:44,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:03:44,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:03:44,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:03:44,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:03:44,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:03:44,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:03:44,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:03:44,493 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:03:44,493 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:03:44,494 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:03:44,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:03:44,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:03:44,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:03:44,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:03:44,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:03:44,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:03:44,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:03:44,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:03:44,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:03:44,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:03:44,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:03:44,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:03:44,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:03:44,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:03:44,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:03:44,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:03:44,501 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 -> 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 [2024-11-19 10:03:44,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:03:44,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:03:44,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:03:44,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:03:44,834 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:03:44,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-1.i [2024-11-19 10:03:46,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:03:46,344 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:03:46,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i [2024-11-19 10:03:46,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70558ff08/4722b252dade40338d711cc90898834e/FLAG08679a67a [2024-11-19 10:03:46,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70558ff08/4722b252dade40338d711cc90898834e [2024-11-19 10:03:46,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:03:46,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:03:46,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:03:46,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:03:46,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:03:46,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:03:46" (1/1) ... [2024-11-19 10:03:46,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a5a7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:46, skipping insertion in model container [2024-11-19 10:03:46,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:03:46" (1/1) ... [2024-11-19 10:03:46,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:03:47,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:03:47,140 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:03:47,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:03:47,216 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:03:47,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:47 WrapperNode [2024-11-19 10:03:47,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:03:47,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:03:47,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:03:47,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:03:47,224 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:03:47" (1/1) ... [2024-11-19 10:03:47,238 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:03:47" (1/1) ... [2024-11-19 10:03:47,292 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 190 [2024-11-19 10:03:47,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:03:47,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:03:47,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:03:47,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:03:47,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:47" (1/1) ... [2024-11-19 10:03:47,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:47" (1/1) ... [2024-11-19 10:03:47,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:47" (1/1) ... [2024-11-19 10:03:47,369 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:03:47,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:47" (1/1) ... [2024-11-19 10:03:47,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:47" (1/1) ... [2024-11-19 10:03:47,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:47" (1/1) ... [2024-11-19 10:03:47,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:47" (1/1) ... [2024-11-19 10:03:47,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:47" (1/1) ... [2024-11-19 10:03:47,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:47" (1/1) ... [2024-11-19 10:03:47,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:03:47,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:03:47,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:03:47,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:03:47,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:47" (1/1) ... [2024-11-19 10:03:47,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:03:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:47,436 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:03:47,438 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:03:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:03:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:03:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:03:47,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:03:47,553 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:03:47,555 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:03:47,821 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-19 10:03:47,822 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:03:47,835 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:03:47,835 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 10:03:47,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:03:47 BoogieIcfgContainer [2024-11-19 10:03:47,836 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:03:47,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:03:47,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:03:47,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:03:47,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:03:46" (1/3) ... [2024-11-19 10:03:47,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d7362d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:03:47, skipping insertion in model container [2024-11-19 10:03:47,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:47" (2/3) ... [2024-11-19 10:03:47,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d7362d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:03:47, skipping insertion in model container [2024-11-19 10:03:47,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:03:47" (3/3) ... [2024-11-19 10:03:47,842 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2024-11-19 10:03:47,855 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:03:47,855 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-19 10:03:47,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:03:47,902 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3fc455b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:03:47,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-19 10:03:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 90 states have (on average 1.8666666666666667) internal successors, (168), 131 states have internal predecessors, (168), 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:03:47,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 10:03:47,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:47,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 10:03:47,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:47,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:47,917 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2024-11-19 10:03:47,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:47,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517479446] [2024-11-19 10:03:47,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:47,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:48,059 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:03:48,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:48,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517479446] [2024-11-19 10:03:48,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517479446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:48,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:48,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 10:03:48,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015624637] [2024-11-19 10:03:48,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:48,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 10:03:48,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:48,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 10:03:48,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:03:48,087 INFO L87 Difference]: Start difference. First operand has 132 states, 90 states have (on average 1.8666666666666667) internal successors, (168), 131 states have internal predecessors, (168), 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) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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:03:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:48,102 INFO L93 Difference]: Finished difference Result 167 states and 226 transitions. [2024-11-19 10:03:48,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 10:03:48,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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:03:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:48,112 INFO L225 Difference]: With dead ends: 167 [2024-11-19 10:03:48,113 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 10:03:48,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:03:48,117 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:48,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:03:48,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 10:03:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-19 10:03:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 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:03:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2024-11-19 10:03:48,170 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 4 [2024-11-19 10:03:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:48,171 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2024-11-19 10:03:48,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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:03:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2024-11-19 10:03:48,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 10:03:48,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:48,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:48,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:03:48,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:48,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:48,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1213044638, now seen corresponding path program 1 times [2024-11-19 10:03:48,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:48,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761752109] [2024-11-19 10:03:48,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:48,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:48,360 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:03:48,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:48,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761752109] [2024-11-19 10:03:48,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761752109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:48,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:48,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:03:48,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354047678] [2024-11-19 10:03:48,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:48,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:03:48,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:48,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:03:48,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:03:48,366 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:03:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:48,498 INFO L93 Difference]: Finished difference Result 165 states and 240 transitions. [2024-11-19 10:03:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:03:48,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-11-19 10:03:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:48,500 INFO L225 Difference]: With dead ends: 165 [2024-11-19 10:03:48,500 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 10:03:48,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:03:48,501 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 30 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:48,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 149 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 10:03:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2024-11-19 10:03:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 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:03:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2024-11-19 10:03:48,515 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 19 [2024-11-19 10:03:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:48,515 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2024-11-19 10:03:48,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:03:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2024-11-19 10:03:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 10:03:48,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:48,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:48,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:03:48,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:48,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:48,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1776244864, now seen corresponding path program 1 times [2024-11-19 10:03:48,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:48,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536521524] [2024-11-19 10:03:48,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:48,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:03:48,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:48,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536521524] [2024-11-19 10:03:48,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536521524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:48,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:48,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:03:48,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464199950] [2024-11-19 10:03:48,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:48,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:48,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:48,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:48,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:48,648 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:03:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:49,019 INFO L93 Difference]: Finished difference Result 234 states and 345 transitions. [2024-11-19 10:03:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:03:49,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-11-19 10:03:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:49,021 INFO L225 Difference]: With dead ends: 234 [2024-11-19 10:03:49,021 INFO L226 Difference]: Without dead ends: 177 [2024-11-19 10:03:49,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:03:49,022 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 114 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:49,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 205 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:03:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-19 10:03:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 129. [2024-11-19 10:03:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.3671875) internal successors, (175), 128 states have internal predecessors, (175), 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:03:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 175 transitions. [2024-11-19 10:03:49,031 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 175 transitions. Word has length 26 [2024-11-19 10:03:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:49,031 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 175 transitions. [2024-11-19 10:03:49,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:03:49,031 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 175 transitions. [2024-11-19 10:03:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 10:03:49,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:49,033 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:49,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:03:49,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:49,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1932025242, now seen corresponding path program 1 times [2024-11-19 10:03:49,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:49,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498236417] [2024-11-19 10:03:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:49,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:03:49,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:49,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498236417] [2024-11-19 10:03:49,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498236417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:49,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:49,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:03:49,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554826094] [2024-11-19 10:03:49,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:49,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:49,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:49,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:49,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:49,147 INFO L87 Difference]: Start difference. First operand 129 states and 175 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:03:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:49,263 INFO L93 Difference]: Finished difference Result 335 states and 454 transitions. [2024-11-19 10:03:49,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:03:49,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 33 [2024-11-19 10:03:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:49,266 INFO L225 Difference]: With dead ends: 335 [2024-11-19 10:03:49,268 INFO L226 Difference]: Without dead ends: 231 [2024-11-19 10:03:49,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:03:49,269 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 110 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:49,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 310 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-19 10:03:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 142. [2024-11-19 10:03:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 141 states have internal predecessors, (191), 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:03:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 191 transitions. [2024-11-19 10:03:49,289 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 191 transitions. Word has length 33 [2024-11-19 10:03:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:49,289 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 191 transitions. [2024-11-19 10:03:49,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:03:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 191 transitions. [2024-11-19 10:03:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 10:03:49,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:49,291 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:49,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:03:49,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:49,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:49,294 INFO L85 PathProgramCache]: Analyzing trace with hash 880692086, now seen corresponding path program 1 times [2024-11-19 10:03:49,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:49,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211065135] [2024-11-19 10:03:49,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:49,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:03:49,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:49,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211065135] [2024-11-19 10:03:49,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211065135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:49,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:49,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:03:49,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608406657] [2024-11-19 10:03:49,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:49,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:49,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:49,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:49,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:49,414 INFO L87 Difference]: Start difference. First operand 142 states and 191 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:03:49,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:49,531 INFO L93 Difference]: Finished difference Result 341 states and 460 transitions. [2024-11-19 10:03:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:03:49,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 36 [2024-11-19 10:03:49,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:49,532 INFO L225 Difference]: With dead ends: 341 [2024-11-19 10:03:49,532 INFO L226 Difference]: Without dead ends: 237 [2024-11-19 10:03:49,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:03:49,534 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 99 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:49,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 300 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-19 10:03:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 155. [2024-11-19 10:03:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.3311688311688312) internal successors, (205), 154 states have internal predecessors, (205), 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:03:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 205 transitions. [2024-11-19 10:03:49,541 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 205 transitions. Word has length 36 [2024-11-19 10:03:49,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:49,541 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 205 transitions. [2024-11-19 10:03:49,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:03:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 205 transitions. [2024-11-19 10:03:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 10:03:49,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:49,543 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:49,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:03:49,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:49,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:49,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1757161921, now seen corresponding path program 1 times [2024-11-19 10:03:49,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:49,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062696049] [2024-11-19 10:03:49,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:49,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:03:49,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062696049] [2024-11-19 10:03:49,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062696049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806052420] [2024-11-19 10:03:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:49,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:49,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:49,631 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:03:49,639 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:03:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:49,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:03:49,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 10:03:49,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:03:49,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806052420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:49,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:03:49,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-19 10:03:49,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933981882] [2024-11-19 10:03:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:49,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:49,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:49,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:49,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:03:49,738 INFO L87 Difference]: Start difference. First operand 155 states and 205 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:03:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:49,884 INFO L93 Difference]: Finished difference Result 310 states and 439 transitions. [2024-11-19 10:03:49,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:03:49,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 39 [2024-11-19 10:03:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:49,886 INFO L225 Difference]: With dead ends: 310 [2024-11-19 10:03:49,889 INFO L226 Difference]: Without dead ends: 208 [2024-11-19 10:03:49,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:03:49,890 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 48 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:49,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 247 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-19 10:03:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 186. [2024-11-19 10:03:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.308108108108108) internal successors, (242), 185 states have internal predecessors, (242), 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:03:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2024-11-19 10:03:49,905 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 39 [2024-11-19 10:03:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:49,905 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2024-11-19 10:03:49,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:03:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2024-11-19 10:03:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 10:03:49,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:49,910 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:49,924 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:03:50,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 10:03:50,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:50,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:50,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1239804479, now seen corresponding path program 1 times [2024-11-19 10:03:50,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:50,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781145800] [2024-11-19 10:03:50,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:50,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:03:50,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:50,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781145800] [2024-11-19 10:03:50,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781145800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:50,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320489205] [2024-11-19 10:03:50,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:50,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:50,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:50,224 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:03:50,226 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:03:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:50,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:03:50,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 10:03:50,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:03:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320489205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:50,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:03:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 10:03:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148120640] [2024-11-19 10:03:50,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:50,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:50,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:50,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:50,342 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:03:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:50,632 INFO L93 Difference]: Finished difference Result 372 states and 507 transitions. [2024-11-19 10:03:50,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:03:50,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 46 [2024-11-19 10:03:50,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:50,633 INFO L225 Difference]: With dead ends: 372 [2024-11-19 10:03:50,633 INFO L226 Difference]: Without dead ends: 239 [2024-11-19 10:03:50,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:50,634 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 47 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:50,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 247 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:03:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-19 10:03:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 211. [2024-11-19 10:03:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 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:03:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 271 transitions. [2024-11-19 10:03:50,644 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 271 transitions. Word has length 46 [2024-11-19 10:03:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:50,645 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 271 transitions. [2024-11-19 10:03:50,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:03:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 271 transitions. [2024-11-19 10:03:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 10:03:50,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:50,646 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:50,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 10:03:50,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-19 10:03:50,847 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:50,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:50,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1676819835, now seen corresponding path program 1 times [2024-11-19 10:03:50,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:50,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232854424] [2024-11-19 10:03:50,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:50,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 10:03:50,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:50,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232854424] [2024-11-19 10:03:50,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232854424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:50,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:50,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:03:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935282994] [2024-11-19 10:03:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:50,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:03:50,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:50,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:03:50,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:03:50,924 INFO L87 Difference]: Start difference. First operand 211 states and 271 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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:03:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:50,964 INFO L93 Difference]: Finished difference Result 258 states and 328 transitions. [2024-11-19 10:03:50,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:03:50,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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 53 [2024-11-19 10:03:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:50,969 INFO L225 Difference]: With dead ends: 258 [2024-11-19 10:03:50,969 INFO L226 Difference]: Without dead ends: 185 [2024-11-19 10:03:50,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:03:50,970 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:50,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 225 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:03:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-19 10:03:50,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-19 10:03:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 184 states have internal predecessors, (235), 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:03:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2024-11-19 10:03:50,980 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 53 [2024-11-19 10:03:50,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:50,980 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2024-11-19 10:03:50,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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:03:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2024-11-19 10:03:50,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 10:03:50,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:50,982 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:50,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:03:50,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:50,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2137686151, now seen corresponding path program 1 times [2024-11-19 10:03:50,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:50,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997975107] [2024-11-19 10:03:50,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:50,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-19 10:03:51,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:51,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997975107] [2024-11-19 10:03:51,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997975107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:51,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:51,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:03:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130520031] [2024-11-19 10:03:51,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:51,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:03:51,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:51,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:03:51,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:03:51,119 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:03:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:51,264 INFO L93 Difference]: Finished difference Result 480 states and 612 transitions. [2024-11-19 10:03:51,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:03:51,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 65 [2024-11-19 10:03:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:51,266 INFO L225 Difference]: With dead ends: 480 [2024-11-19 10:03:51,266 INFO L226 Difference]: Without dead ends: 346 [2024-11-19 10:03:51,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:51,267 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 152 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:51,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 197 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-19 10:03:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 227. [2024-11-19 10:03:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.2743362831858407) internal successors, (288), 226 states have internal predecessors, (288), 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:03:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 288 transitions. [2024-11-19 10:03:51,278 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 288 transitions. Word has length 65 [2024-11-19 10:03:51,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:51,278 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 288 transitions. [2024-11-19 10:03:51,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:03:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 288 transitions. [2024-11-19 10:03:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 10:03:51,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:51,280 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:51,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 10:03:51,280 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:51,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2110196596, now seen corresponding path program 1 times [2024-11-19 10:03:51,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:51,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304647675] [2024-11-19 10:03:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:51,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 10:03:51,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:51,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304647675] [2024-11-19 10:03:51,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304647675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:51,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:51,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:03:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679772914] [2024-11-19 10:03:51,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:51,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:51,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:51,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:51,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:51,399 INFO L87 Difference]: Start difference. First operand 227 states and 288 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:03:51,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:51,441 INFO L93 Difference]: Finished difference Result 513 states and 651 transitions. [2024-11-19 10:03:51,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:03:51,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 68 [2024-11-19 10:03:51,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:51,443 INFO L225 Difference]: With dead ends: 513 [2024-11-19 10:03:51,443 INFO L226 Difference]: Without dead ends: 337 [2024-11-19 10:03:51,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:51,444 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 68 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:51,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 387 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:03:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-19 10:03:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 249. [2024-11-19 10:03:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.2983870967741935) internal successors, (322), 248 states have internal predecessors, (322), 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:03:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 322 transitions. [2024-11-19 10:03:51,450 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 322 transitions. Word has length 68 [2024-11-19 10:03:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:51,451 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 322 transitions. [2024-11-19 10:03:51,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:03:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 322 transitions. [2024-11-19 10:03:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 10:03:51,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:51,452 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:51,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:03:51,452 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:51,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:51,452 INFO L85 PathProgramCache]: Analyzing trace with hash -301960682, now seen corresponding path program 1 times [2024-11-19 10:03:51,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:51,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203979206] [2024-11-19 10:03:51,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:51,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:03:51,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:51,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203979206] [2024-11-19 10:03:51,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203979206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:51,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:51,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:03:51,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707859877] [2024-11-19 10:03:51,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:51,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:03:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:51,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:03:51,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:03:51,590 INFO L87 Difference]: Start difference. First operand 249 states and 322 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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:03:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:51,742 INFO L93 Difference]: Finished difference Result 685 states and 891 transitions. [2024-11-19 10:03:51,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:03:51,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 74 [2024-11-19 10:03:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:51,744 INFO L225 Difference]: With dead ends: 685 [2024-11-19 10:03:51,744 INFO L226 Difference]: Without dead ends: 482 [2024-11-19 10:03:51,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:03:51,745 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 162 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:51,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 232 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-19 10:03:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 407. [2024-11-19 10:03:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.2857142857142858) internal successors, (522), 406 states have internal predecessors, (522), 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:03:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 522 transitions. [2024-11-19 10:03:51,753 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 522 transitions. Word has length 74 [2024-11-19 10:03:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:51,754 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 522 transitions. [2024-11-19 10:03:51,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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:03:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 522 transitions. [2024-11-19 10:03:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 10:03:51,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:51,755 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:51,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 10:03:51,755 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:51,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:51,755 INFO L85 PathProgramCache]: Analyzing trace with hash -326786310, now seen corresponding path program 1 times [2024-11-19 10:03:51,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:51,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241004961] [2024-11-19 10:03:51,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:51,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 10:03:51,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:51,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241004961] [2024-11-19 10:03:51,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241004961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:51,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987887147] [2024-11-19 10:03:51,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:51,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:51,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:51,854 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:03:51,857 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:03:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:51,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:03:51,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 10:03:51,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:03:51,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987887147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:51,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:03:51,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-19 10:03:51,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700017711] [2024-11-19 10:03:51,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:51,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:51,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:51,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:51,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:51,969 INFO L87 Difference]: Start difference. First operand 407 states and 522 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:03:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:52,040 INFO L93 Difference]: Finished difference Result 1047 states and 1341 transitions. [2024-11-19 10:03:52,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:03:52,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 74 [2024-11-19 10:03:52,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:52,043 INFO L225 Difference]: With dead ends: 1047 [2024-11-19 10:03:52,043 INFO L226 Difference]: Without dead ends: 649 [2024-11-19 10:03:52,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:52,044 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 49 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:52,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 177 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-19 10:03:52,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 555. [2024-11-19 10:03:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.2761732851985559) internal successors, (707), 554 states have internal predecessors, (707), 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:03:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 707 transitions. [2024-11-19 10:03:52,059 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 707 transitions. Word has length 74 [2024-11-19 10:03:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:52,059 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 707 transitions. [2024-11-19 10:03:52,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:03:52,060 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 707 transitions. [2024-11-19 10:03:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 10:03:52,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:52,061 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:52,077 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:03:52,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:52,262 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:52,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:52,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1468144829, now seen corresponding path program 1 times [2024-11-19 10:03:52,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:52,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150324572] [2024-11-19 10:03:52,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:52,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:03:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:52,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150324572] [2024-11-19 10:03:52,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150324572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:52,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:52,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:03:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009670427] [2024-11-19 10:03:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:52,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:03:52,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:52,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:03:52,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:03:52,369 INFO L87 Difference]: Start difference. First operand 555 states and 707 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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:03:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:52,542 INFO L93 Difference]: Finished difference Result 1345 states and 1704 transitions. [2024-11-19 10:03:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:03:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 74 [2024-11-19 10:03:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:52,545 INFO L225 Difference]: With dead ends: 1345 [2024-11-19 10:03:52,545 INFO L226 Difference]: Without dead ends: 794 [2024-11-19 10:03:52,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:03:52,546 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 156 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:52,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 349 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:52,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-11-19 10:03:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 696. [2024-11-19 10:03:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 1.2618705035971223) internal successors, (877), 695 states have internal predecessors, (877), 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:03:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 877 transitions. [2024-11-19 10:03:52,562 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 877 transitions. Word has length 74 [2024-11-19 10:03:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:52,562 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 877 transitions. [2024-11-19 10:03:52,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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:03:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 877 transitions. [2024-11-19 10:03:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 10:03:52,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:52,564 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:52,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 10:03:52,564 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:52,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:52,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2112281364, now seen corresponding path program 1 times [2024-11-19 10:03:52,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:52,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689824782] [2024-11-19 10:03:52,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:52,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 10:03:52,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:52,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689824782] [2024-11-19 10:03:52,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689824782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:52,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:52,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:03:52,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437797281] [2024-11-19 10:03:52,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:52,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:03:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:52,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:03:52,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:52,686 INFO L87 Difference]: Start difference. First operand 696 states and 877 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:03:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:52,939 INFO L93 Difference]: Finished difference Result 1731 states and 2171 transitions. [2024-11-19 10:03:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 10:03:52,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 80 [2024-11-19 10:03:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:52,942 INFO L225 Difference]: With dead ends: 1731 [2024-11-19 10:03:52,942 INFO L226 Difference]: Without dead ends: 961 [2024-11-19 10:03:52,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:03:52,944 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 198 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:52,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 319 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:03:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2024-11-19 10:03:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 826. [2024-11-19 10:03:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 1.2642424242424242) internal successors, (1043), 825 states have internal predecessors, (1043), 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:03:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1043 transitions. [2024-11-19 10:03:52,962 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1043 transitions. Word has length 80 [2024-11-19 10:03:52,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:52,962 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1043 transitions. [2024-11-19 10:03:52,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:03:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1043 transitions. [2024-11-19 10:03:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 10:03:52,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:52,964 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:52,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 10:03:52,964 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:52,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1262585566, now seen corresponding path program 1 times [2024-11-19 10:03:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:52,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649529437] [2024-11-19 10:03:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:52,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 10:03:53,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:53,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649529437] [2024-11-19 10:03:53,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649529437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:53,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194762165] [2024-11-19 10:03:53,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:53,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:53,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:53,069 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:03:53,070 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:03:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:53,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 10:03:53,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 10:03:53,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:03:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 10:03:53,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194762165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:03:53,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:03:53,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2024-11-19 10:03:53,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847610686] [2024-11-19 10:03:53,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:03:53,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:03:53,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:53,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:03:53,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:03:53,260 INFO L87 Difference]: Start difference. First operand 826 states and 1043 transitions. Second operand has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 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:03:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:54,430 INFO L93 Difference]: Finished difference Result 4972 states and 6140 transitions. [2024-11-19 10:03:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-19 10:03:54,430 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 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 80 [2024-11-19 10:03:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:54,441 INFO L225 Difference]: With dead ends: 4972 [2024-11-19 10:03:54,441 INFO L226 Difference]: Without dead ends: 4016 [2024-11-19 10:03:54,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=592, Invalid=2600, Unknown=0, NotChecked=0, Total=3192 [2024-11-19 10:03:54,445 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 842 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:54,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1470 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 10:03:54,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2024-11-19 10:03:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 1079. [2024-11-19 10:03:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.4063079777365493) internal successors, (1516), 1078 states have internal predecessors, (1516), 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:03:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1516 transitions. [2024-11-19 10:03:54,494 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1516 transitions. Word has length 80 [2024-11-19 10:03:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:54,495 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1516 transitions. [2024-11-19 10:03:54,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 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:03:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1516 transitions. [2024-11-19 10:03:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 10:03:54,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:54,496 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:54,510 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:03:54,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 10:03:54,697 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:54,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1514248837, now seen corresponding path program 1 times [2024-11-19 10:03:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:54,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125053579] [2024-11-19 10:03:54,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:54,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 10:03:54,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:54,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125053579] [2024-11-19 10:03:54,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125053579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:54,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:54,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:03:54,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227281687] [2024-11-19 10:03:54,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:54,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:03:54,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:54,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:03:54,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:54,817 INFO L87 Difference]: Start difference. First operand 1079 states and 1516 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:03:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:55,046 INFO L93 Difference]: Finished difference Result 2425 states and 3400 transitions. [2024-11-19 10:03:55,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 10:03:55,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 80 [2024-11-19 10:03:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:55,049 INFO L225 Difference]: With dead ends: 2425 [2024-11-19 10:03:55,050 INFO L226 Difference]: Without dead ends: 1331 [2024-11-19 10:03:55,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:03:55,051 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 254 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:55,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 306 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:03:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2024-11-19 10:03:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1239. [2024-11-19 10:03:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 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:03:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions. [2024-11-19 10:03:55,079 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 80 [2024-11-19 10:03:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:55,079 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions. [2024-11-19 10:03:55,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:03:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions. [2024-11-19 10:03:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 10:03:55,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:55,081 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:55,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 10:03:55,081 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:55,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:55,081 INFO L85 PathProgramCache]: Analyzing trace with hash -468213532, now seen corresponding path program 1 times [2024-11-19 10:03:55,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:55,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201238387] [2024-11-19 10:03:55,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:55,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-19 10:03:55,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:55,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201238387] [2024-11-19 10:03:55,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201238387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:55,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:55,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:03:55,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463670873] [2024-11-19 10:03:55,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:55,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:03:55,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:55,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:03:55,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:03:55,229 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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:03:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:55,437 INFO L93 Difference]: Finished difference Result 3836 states and 5402 transitions. [2024-11-19 10:03:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:03:55,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 86 [2024-11-19 10:03:55,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:55,447 INFO L225 Difference]: With dead ends: 3836 [2024-11-19 10:03:55,448 INFO L226 Difference]: Without dead ends: 3649 [2024-11-19 10:03:55,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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:03:55,449 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 219 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:55,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 458 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2024-11-19 10:03:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 1239. [2024-11-19 10:03:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 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:03:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions. [2024-11-19 10:03:55,503 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 86 [2024-11-19 10:03:55,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:55,503 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions. [2024-11-19 10:03:55,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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:03:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions. [2024-11-19 10:03:55,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 10:03:55,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:55,505 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:55,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 10:03:55,505 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:55,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:55,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1893852281, now seen corresponding path program 1 times [2024-11-19 10:03:55,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:55,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102280537] [2024-11-19 10:03:55,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:55,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-19 10:03:55,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102280537] [2024-11-19 10:03:55,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102280537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:55,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:55,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:03:55,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601577397] [2024-11-19 10:03:55,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:55,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:03:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:55,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:03:55,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:03:55,608 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:03:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:55,632 INFO L93 Difference]: Finished difference Result 2427 states and 3430 transitions. [2024-11-19 10:03:55,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:03:55,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 86 [2024-11-19 10:03:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:55,635 INFO L225 Difference]: With dead ends: 2427 [2024-11-19 10:03:55,635 INFO L226 Difference]: Without dead ends: 1216 [2024-11-19 10:03:55,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:03:55,637 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 90 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:55,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 93 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:03:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-19 10:03:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2024-11-19 10:03:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 1.4123456790123456) internal successors, (1716), 1215 states have internal predecessors, (1716), 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:03:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1716 transitions. [2024-11-19 10:03:55,668 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1716 transitions. Word has length 86 [2024-11-19 10:03:55,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:55,668 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1716 transitions. [2024-11-19 10:03:55,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:03:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1716 transitions. [2024-11-19 10:03:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 10:03:55,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:55,671 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:55,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 10:03:55,672 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:55,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:55,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1148768933, now seen corresponding path program 1 times [2024-11-19 10:03:55,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:55,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602382714] [2024-11-19 10:03:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 33 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 10:03:55,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:55,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602382714] [2024-11-19 10:03:55,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602382714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:55,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575243924] [2024-11-19 10:03:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:55,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:55,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:55,924 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:03:55,928 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:03:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:56,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 10:03:56,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-19 10:03:56,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:03:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-19 10:03:56,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575243924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:03:56,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:03:56,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2024-11-19 10:03:56,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557955896] [2024-11-19 10:03:56,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:03:56,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 10:03:56,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:56,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 10:03:56,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-19 10:03:56,358 INFO L87 Difference]: Start difference. First operand 1216 states and 1716 transitions. Second operand has 17 states, 17 states have (on average 11.176470588235293) internal successors, (190), 17 states have internal predecessors, (190), 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:03:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:58,917 INFO L93 Difference]: Finished difference Result 11727 states and 15093 transitions. [2024-11-19 10:03:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-11-19 10:03:58,918 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 11.176470588235293) internal successors, (190), 17 states have internal predecessors, (190), 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 89 [2024-11-19 10:03:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:58,967 INFO L225 Difference]: With dead ends: 11727 [2024-11-19 10:03:58,971 INFO L226 Difference]: Without dead ends: 10311 [2024-11-19 10:03:58,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3434 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1682, Invalid=8418, Unknown=0, NotChecked=0, Total=10100 [2024-11-19 10:03:58,984 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 2248 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2248 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:58,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2248 Valid, 3138 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 10:03:58,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10311 states. [2024-11-19 10:03:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10311 to 2487. [2024-11-19 10:03:59,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2486 states have (on average 1.3958165728077232) internal successors, (3470), 2486 states have internal predecessors, (3470), 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:03:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3470 transitions. [2024-11-19 10:03:59,298 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3470 transitions. Word has length 89 [2024-11-19 10:03:59,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:59,302 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3470 transitions. [2024-11-19 10:03:59,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.176470588235293) internal successors, (190), 17 states have internal predecessors, (190), 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:03:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3470 transitions. [2024-11-19 10:03:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 10:03:59,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:59,304 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:59,328 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:03:59,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:59,507 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:59,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:59,507 INFO L85 PathProgramCache]: Analyzing trace with hash 391708728, now seen corresponding path program 1 times [2024-11-19 10:03:59,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:59,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916802033] [2024-11-19 10:03:59,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:59,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-19 10:03:59,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:59,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916802033] [2024-11-19 10:03:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916802033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:59,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200058962] [2024-11-19 10:03:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:59,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:59,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:59,620 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:03:59,621 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:03:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:59,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 10:03:59,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 10:03:59,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:03:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 10:03:59,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200058962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:03:59,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:03:59,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2024-11-19 10:03:59,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24961327] [2024-11-19 10:03:59,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:03:59,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 10:03:59,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:59,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 10:03:59,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 10:03:59,813 INFO L87 Difference]: Start difference. First operand 2487 states and 3470 transitions. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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:04:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:00,577 INFO L93 Difference]: Finished difference Result 8666 states and 12462 transitions. [2024-11-19 10:04:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 10:04:00,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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 89 [2024-11-19 10:04:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:00,616 INFO L225 Difference]: With dead ends: 8666 [2024-11-19 10:04:00,616 INFO L226 Difference]: Without dead ends: 6147 [2024-11-19 10:04:00,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2024-11-19 10:04:00,629 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 398 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:00,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 463 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 10:04:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2024-11-19 10:04:00,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 4431. [2024-11-19 10:04:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4431 states, 4430 states have (on average 1.2600451467268623) internal successors, (5582), 4430 states have internal predecessors, (5582), 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:04:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 5582 transitions. [2024-11-19 10:04:00,956 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 5582 transitions. Word has length 89 [2024-11-19 10:04:00,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:00,956 INFO L471 AbstractCegarLoop]: Abstraction has 4431 states and 5582 transitions. [2024-11-19 10:04:00,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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:04:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 5582 transitions. [2024-11-19 10:04:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 10:04:00,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:00,958 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:00,972 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:04:01,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:01,160 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:04:01,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:01,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1857009734, now seen corresponding path program 1 times [2024-11-19 10:04:01,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:01,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029319818] [2024-11-19 10:04:01,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:01,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-19 10:04:01,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:01,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029319818] [2024-11-19 10:04:01,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029319818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:01,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398215414] [2024-11-19 10:04:01,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:01,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:01,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:01,382 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:04:01,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 10:04:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:01,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 10:04:01,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 10:04:01,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:01,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398215414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:01,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:04:01,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-19 10:04:01,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332506033] [2024-11-19 10:04:01,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:01,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:01,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:01,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:01,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:01,481 INFO L87 Difference]: Start difference. First operand 4431 states and 5582 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:04:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:01,716 INFO L93 Difference]: Finished difference Result 4993 states and 6259 transitions. [2024-11-19 10:04:01,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:01,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 89 [2024-11-19 10:04:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:01,738 INFO L225 Difference]: With dead ends: 4993 [2024-11-19 10:04:01,741 INFO L226 Difference]: Without dead ends: 4357 [2024-11-19 10:04:01,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:01,744 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 45 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:01,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 143 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2024-11-19 10:04:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 4335. [2024-11-19 10:04:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4335 states, 4334 states have (on average 1.2526534379326257) internal successors, (5429), 4334 states have internal predecessors, (5429), 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:04:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 4335 states and 5429 transitions. [2024-11-19 10:04:02,051 INFO L78 Accepts]: Start accepts. Automaton has 4335 states and 5429 transitions. Word has length 89 [2024-11-19 10:04:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:02,051 INFO L471 AbstractCegarLoop]: Abstraction has 4335 states and 5429 transitions. [2024-11-19 10:04:02,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:04:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 4335 states and 5429 transitions. [2024-11-19 10:04:02,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 10:04:02,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:02,053 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:02,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 10:04:02,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:02,254 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:04:02,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:02,254 INFO L85 PathProgramCache]: Analyzing trace with hash 187539442, now seen corresponding path program 1 times [2024-11-19 10:04:02,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:02,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113793959] [2024-11-19 10:04:02,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:02,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-19 10:04:02,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:02,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113793959] [2024-11-19 10:04:02,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113793959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:02,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:02,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:02,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761013991] [2024-11-19 10:04:02,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:02,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:02,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:02,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:02,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:04:02,343 INFO L87 Difference]: Start difference. First operand 4335 states and 5429 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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:04:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:02,452 INFO L93 Difference]: Finished difference Result 4345 states and 5440 transitions. [2024-11-19 10:04:02,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:02,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 90 [2024-11-19 10:04:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:02,458 INFO L225 Difference]: With dead ends: 4345 [2024-11-19 10:04:02,458 INFO L226 Difference]: Without dead ends: 4341 [2024-11-19 10:04:02,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:04:02,460 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:02,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 234 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2024-11-19 10:04:02,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 4339. [2024-11-19 10:04:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4339 states, 4338 states have (on average 1.252420470262794) internal successors, (5433), 4338 states have internal predecessors, (5433), 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:04:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 5433 transitions. [2024-11-19 10:04:02,648 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 5433 transitions. Word has length 90 [2024-11-19 10:04:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:02,649 INFO L471 AbstractCegarLoop]: Abstraction has 4339 states and 5433 transitions. [2024-11-19 10:04:02,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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:04:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 5433 transitions. [2024-11-19 10:04:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 10:04:02,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:02,651 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:02,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 10:04:02,652 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:04:02,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash -570015532, now seen corresponding path program 1 times [2024-11-19 10:04:02,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:02,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608011424] [2024-11-19 10:04:02,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 53 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 10:04:02,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:02,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608011424] [2024-11-19 10:04:02,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608011424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:02,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079920763] [2024-11-19 10:04:02,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:02,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:02,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:02,788 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:04:02,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 10:04:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:02,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:04:02,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-19 10:04:02,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:02,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079920763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:02,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:04:02,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-19 10:04:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342480483] [2024-11-19 10:04:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:02,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:02,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:02,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:02,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:02,890 INFO L87 Difference]: Start difference. First operand 4339 states and 5433 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:04:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:03,000 INFO L93 Difference]: Finished difference Result 4349 states and 5444 transitions. [2024-11-19 10:04:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:03,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 91 [2024-11-19 10:04:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:03,006 INFO L225 Difference]: With dead ends: 4349 [2024-11-19 10:04:03,006 INFO L226 Difference]: Without dead ends: 4345 [2024-11-19 10:04:03,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:03,008 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:03,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 253 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4345 states. [2024-11-19 10:04:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4345 to 4339. [2024-11-19 10:04:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4339 states, 4338 states have (on average 1.252420470262794) internal successors, (5433), 4338 states have internal predecessors, (5433), 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:04:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 5433 transitions. [2024-11-19 10:04:03,179 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 5433 transitions. Word has length 91 [2024-11-19 10:04:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:03,180 INFO L471 AbstractCegarLoop]: Abstraction has 4339 states and 5433 transitions. [2024-11-19 10:04:03,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:04:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 5433 transitions. [2024-11-19 10:04:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 10:04:03,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:03,182 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:03,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 10:04:03,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 10:04:03,386 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:04:03,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:03,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1520422031, now seen corresponding path program 1 times [2024-11-19 10:04:03,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:03,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855366834] [2024-11-19 10:04:03,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:03,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 53 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 10:04:03,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:03,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855366834] [2024-11-19 10:04:03,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855366834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:03,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026535172] [2024-11-19 10:04:03,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:03,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:03,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:03,519 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:04:03,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 10:04:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:03,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:04:03,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 53 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 10:04:03,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:04:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 53 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 10:04:03,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026535172] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:04:03,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:04:03,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-19 10:04:03,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780228506] [2024-11-19 10:04:03,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:04:03,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 10:04:03,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:03,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 10:04:03,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:04:03,734 INFO L87 Difference]: Start difference. First operand 4339 states and 5433 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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:04:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:04,025 INFO L93 Difference]: Finished difference Result 9630 states and 11873 transitions. [2024-11-19 10:04:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 10:04:04,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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 91 [2024-11-19 10:04:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:04,032 INFO L225 Difference]: With dead ends: 9630 [2024-11-19 10:04:04,032 INFO L226 Difference]: Without dead ends: 5322 [2024-11-19 10:04:04,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-19 10:04:04,035 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 255 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:04,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 448 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2024-11-19 10:04:04,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 4257. [2024-11-19 10:04:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4257 states, 4256 states have (on average 1.2297932330827068) internal successors, (5234), 4256 states have internal predecessors, (5234), 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:04:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 5234 transitions. [2024-11-19 10:04:04,168 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 5234 transitions. Word has length 91 [2024-11-19 10:04:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:04,169 INFO L471 AbstractCegarLoop]: Abstraction has 4257 states and 5234 transitions. [2024-11-19 10:04:04,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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:04:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 5234 transitions. [2024-11-19 10:04:04,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 10:04:04,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:04,171 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:04,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 10:04:04,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 10:04:04,371 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:04:04,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1898526259, now seen corresponding path program 1 times [2024-11-19 10:04:04,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:04,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149503933] [2024-11-19 10:04:04,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:04,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 10:04:04,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:04,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149503933] [2024-11-19 10:04:04,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149503933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:04,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582873354] [2024-11-19 10:04:04,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:04,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:04,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:04,560 INFO L229 MonitoredProcess]: Starting monitored process 11 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:04:04,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 10:04:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:04,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 10:04:04,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-19 10:04:04,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:04,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582873354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:04,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:04:04,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-11-19 10:04:04,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352943634] [2024-11-19 10:04:04,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:04,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:04:04,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:04,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:04:04,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 10:04:04,721 INFO L87 Difference]: Start difference. First operand 4257 states and 5234 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:04:05,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:05,142 INFO L93 Difference]: Finished difference Result 9760 states and 12031 transitions. [2024-11-19 10:04:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 10:04:05,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 91 [2024-11-19 10:04:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:05,155 INFO L225 Difference]: With dead ends: 9760 [2024-11-19 10:04:05,155 INFO L226 Difference]: Without dead ends: 9141 [2024-11-19 10:04:05,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:04:05,158 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 222 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:05,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 670 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:04:05,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9141 states. [2024-11-19 10:04:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9141 to 4257. [2024-11-19 10:04:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4257 states, 4256 states have (on average 1.2297932330827068) internal successors, (5234), 4256 states have internal predecessors, (5234), 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:04:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 5234 transitions. [2024-11-19 10:04:05,405 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 5234 transitions. Word has length 91 [2024-11-19 10:04:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:05,405 INFO L471 AbstractCegarLoop]: Abstraction has 4257 states and 5234 transitions. [2024-11-19 10:04:05,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:04:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 5234 transitions. [2024-11-19 10:04:05,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 10:04:05,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:05,408 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:05,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 10:04:05,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-19 10:04:05,608 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:04:05,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:05,609 INFO L85 PathProgramCache]: Analyzing trace with hash -738676951, now seen corresponding path program 1 times [2024-11-19 10:04:05,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:05,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607640531] [2024-11-19 10:04:05,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:05,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-19 10:04:05,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:05,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607640531] [2024-11-19 10:04:05,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607640531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:05,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:05,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:04:05,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578607189] [2024-11-19 10:04:05,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:05,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:04:05,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:05,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:04:05,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:05,927 INFO L87 Difference]: Start difference. First operand 4257 states and 5234 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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:04:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:06,916 INFO L93 Difference]: Finished difference Result 8216 states and 10102 transitions. [2024-11-19 10:04:06,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:04:06,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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 93 [2024-11-19 10:04:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:06,939 INFO L225 Difference]: With dead ends: 8216 [2024-11-19 10:04:06,940 INFO L226 Difference]: Without dead ends: 7943 [2024-11-19 10:04:06,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 10:04:06,946 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 385 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:06,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 815 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 10:04:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2024-11-19 10:04:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 4255. [2024-11-19 10:04:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4255 states, 4254 states have (on average 1.2296661965209215) internal successors, (5231), 4254 states have internal predecessors, (5231), 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:04:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 5231 transitions. [2024-11-19 10:04:07,153 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 5231 transitions. Word has length 93 [2024-11-19 10:04:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:07,153 INFO L471 AbstractCegarLoop]: Abstraction has 4255 states and 5231 transitions. [2024-11-19 10:04:07,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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:04:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 5231 transitions. [2024-11-19 10:04:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 10:04:07,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:07,155 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:07,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 10:04:07,156 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:04:07,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:07,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1681186868, now seen corresponding path program 1 times [2024-11-19 10:04:07,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:07,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094632481] [2024-11-19 10:04:07,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:07,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:04:07,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:07,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094632481] [2024-11-19 10:04:07,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094632481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:07,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873446223] [2024-11-19 10:04:07,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:07,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:07,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:07,311 INFO L229 MonitoredProcess]: Starting monitored process 12 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:04:07,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 10:04:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:07,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 10:04:07,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 10:04:07,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:07,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873446223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:07,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:04:07,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-19 10:04:07,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787449386] [2024-11-19 10:04:07,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:07,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:07,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:07,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:07,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:04:07,472 INFO L87 Difference]: Start difference. First operand 4255 states and 5231 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:04:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:07,770 INFO L93 Difference]: Finished difference Result 5167 states and 6280 transitions. [2024-11-19 10:04:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:07,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 95 [2024-11-19 10:04:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:07,784 INFO L225 Difference]: With dead ends: 5167 [2024-11-19 10:04:07,784 INFO L226 Difference]: Without dead ends: 3853 [2024-11-19 10:04:07,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:04:07,791 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 48 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:07,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 105 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2024-11-19 10:04:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3651. [2024-11-19 10:04:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 3650 states have (on average 1.2342465753424658) internal successors, (4505), 3650 states have internal predecessors, (4505), 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:04:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4505 transitions. [2024-11-19 10:04:07,913 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4505 transitions. Word has length 95 [2024-11-19 10:04:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:07,913 INFO L471 AbstractCegarLoop]: Abstraction has 3651 states and 4505 transitions. [2024-11-19 10:04:07,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:04:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4505 transitions. [2024-11-19 10:04:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 10:04:07,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:07,915 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:07,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 10:04:08,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-19 10:04:08,116 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:04:08,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1636800679, now seen corresponding path program 1 times [2024-11-19 10:04:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:08,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852839999] [2024-11-19 10:04:08,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:08,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 10:04:08,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:08,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852839999] [2024-11-19 10:04:08,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852839999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:08,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866057450] [2024-11-19 10:04:08,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:08,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:08,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:08,329 INFO L229 MonitoredProcess]: Starting monitored process 13 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:04:08,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 10:04:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:08,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 10:04:08,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 10:04:08,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:04:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 10:04:08,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866057450] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:04:08,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:04:08,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-11-19 10:04:08,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801608569] [2024-11-19 10:04:08,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:04:08,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 10:04:08,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:08,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 10:04:08,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-19 10:04:08,854 INFO L87 Difference]: Start difference. First operand 3651 states and 4505 transitions. Second operand has 17 states, 16 states have (on average 16.375) internal successors, (262), 17 states have internal predecessors, (262), 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:04:10,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:10,014 INFO L93 Difference]: Finished difference Result 11787 states and 13791 transitions. [2024-11-19 10:04:10,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-19 10:04:10,015 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 16.375) internal successors, (262), 17 states have internal predecessors, (262), 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 97 [2024-11-19 10:04:10,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:10,025 INFO L225 Difference]: With dead ends: 11787 [2024-11-19 10:04:10,025 INFO L226 Difference]: Without dead ends: 6892 [2024-11-19 10:04:10,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=586, Invalid=1576, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 10:04:10,030 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 900 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:10,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1715 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:04:10,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6892 states. [2024-11-19 10:04:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6892 to 1619. [2024-11-19 10:04:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1618 states have (on average 1.223114956736712) internal successors, (1979), 1618 states have internal predecessors, (1979), 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:04:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 1979 transitions. [2024-11-19 10:04:10,107 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 1979 transitions. Word has length 97 [2024-11-19 10:04:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:10,107 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 1979 transitions. [2024-11-19 10:04:10,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 16.375) internal successors, (262), 17 states have internal predecessors, (262), 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:04:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 1979 transitions. [2024-11-19 10:04:10,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 10:04:10,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:10,108 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:10,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 10:04:10,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-19 10:04:10,309 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:04:10,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:10,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1881836762, now seen corresponding path program 1 times [2024-11-19 10:04:10,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:10,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875086222] [2024-11-19 10:04:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:10,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:04:10,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:10,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875086222] [2024-11-19 10:04:10,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875086222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:10,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932420561] [2024-11-19 10:04:10,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:10,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:10,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:10,648 INFO L229 MonitoredProcess]: Starting monitored process 14 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:04:10,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 10:04:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:10,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 10:04:10,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:10,807 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 10:04:10,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:10,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932420561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:10,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:04:10,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 12 [2024-11-19 10:04:10,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770051943] [2024-11-19 10:04:10,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:10,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:10,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:10,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:10,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:04:10,809 INFO L87 Difference]: Start difference. First operand 1619 states and 1979 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:04:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:10,903 INFO L93 Difference]: Finished difference Result 2717 states and 3338 transitions. [2024-11-19 10:04:10,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:10,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 101 [2024-11-19 10:04:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:10,906 INFO L225 Difference]: With dead ends: 2717 [2024-11-19 10:04:10,906 INFO L226 Difference]: Without dead ends: 1065 [2024-11-19 10:04:10,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:04:10,907 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 15 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:10,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 167 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-11-19 10:04:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 841. [2024-11-19 10:04:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 1.2273809523809525) internal successors, (1031), 840 states have internal predecessors, (1031), 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:04:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1031 transitions. [2024-11-19 10:04:10,954 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1031 transitions. Word has length 101 [2024-11-19 10:04:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:10,954 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1031 transitions. [2024-11-19 10:04:10,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:04:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1031 transitions. [2024-11-19 10:04:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 10:04:10,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:10,955 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:10,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-19 10:04:11,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-19 10:04:11,156 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:04:11,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2012530208, now seen corresponding path program 1 times [2024-11-19 10:04:11,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:11,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270439656] [2024-11-19 10:04:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:11,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:04:11,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 10:04:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:04:11,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 10:04:11,285 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 10:04:11,285 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2024-11-19 10:04:11,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2024-11-19 10:04:11,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2024-11-19 10:04:11,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2024-11-19 10:04:11,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2024-11-19 10:04:11,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2024-11-19 10:04:11,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2024-11-19 10:04:11,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2024-11-19 10:04:11,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2024-11-19 10:04:11,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2024-11-19 10:04:11,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2024-11-19 10:04:11,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2024-11-19 10:04:11,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2024-11-19 10:04:11,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2024-11-19 10:04:11,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2024-11-19 10:04:11,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2024-11-19 10:04:11,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2024-11-19 10:04:11,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2024-11-19 10:04:11,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2024-11-19 10:04:11,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2024-11-19 10:04:11,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2024-11-19 10:04:11,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2024-11-19 10:04:11,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2024-11-19 10:04:11,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2024-11-19 10:04:11,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2024-11-19 10:04:11,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2024-11-19 10:04:11,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2024-11-19 10:04:11,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2024-11-19 10:04:11,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2024-11-19 10:04:11,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2024-11-19 10:04:11,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2024-11-19 10:04:11,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2024-11-19 10:04:11,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2024-11-19 10:04:11,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2024-11-19 10:04:11,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2024-11-19 10:04:11,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2024-11-19 10:04:11,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2024-11-19 10:04:11,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2024-11-19 10:04:11,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2024-11-19 10:04:11,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2024-11-19 10:04:11,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2024-11-19 10:04:11,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 10:04:11,295 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:11,395 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:04:11,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:04:11 BoogieIcfgContainer [2024-11-19 10:04:11,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:04:11,400 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:04:11,400 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:04:11,400 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:04:11,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:03:47" (3/4) ... [2024-11-19 10:04:11,402 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 10:04:11,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:04:11,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:04:11,467 INFO L158 Benchmark]: Toolchain (without parser) took 24700.41ms. Allocated memory was 153.1MB in the beginning and 1.0GB in the end (delta: 859.8MB). Free memory was 81.7MB in the beginning and 755.2MB in the end (delta: -673.5MB). Peak memory consumption was 188.3MB. Max. memory is 16.1GB. [2024-11-19 10:04:11,467 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 153.1MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:04:11,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.58ms. Allocated memory is still 153.1MB. Free memory was 81.5MB in the beginning and 66.5MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 10:04:11,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.35ms. Allocated memory is still 153.1MB. Free memory was 66.5MB in the beginning and 62.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:04:11,468 INFO L158 Benchmark]: Boogie Preprocessor took 98.37ms. Allocated memory was 153.1MB in the beginning and 264.2MB in the end (delta: 111.1MB). Free memory was 62.4MB in the beginning and 230.0MB in the end (delta: -167.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-19 10:04:11,468 INFO L158 Benchmark]: RCFGBuilder took 438.03ms. Allocated memory is still 264.2MB. Free memory was 229.9MB in the beginning and 206.6MB in the end (delta: 23.3MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2024-11-19 10:04:11,468 INFO L158 Benchmark]: TraceAbstraction took 23562.39ms. Allocated memory was 264.2MB in the beginning and 1.0GB in the end (delta: 748.7MB). Free memory was 205.6MB in the beginning and 763.6MB in the end (delta: -558.0MB). Peak memory consumption was 190.7MB. Max. memory is 16.1GB. [2024-11-19 10:04:11,468 INFO L158 Benchmark]: Witness Printer took 66.25ms. Allocated memory is still 1.0GB. Free memory was 763.6MB in the beginning and 755.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 10:04:11,469 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.76ms. Allocated memory is still 153.1MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.58ms. Allocated memory is still 153.1MB. Free memory was 81.5MB in the beginning and 66.5MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.35ms. Allocated memory is still 153.1MB. Free memory was 66.5MB in the beginning and 62.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.37ms. Allocated memory was 153.1MB in the beginning and 264.2MB in the end (delta: 111.1MB). Free memory was 62.4MB in the beginning and 230.0MB in the end (delta: -167.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * RCFGBuilder took 438.03ms. Allocated memory is still 264.2MB. Free memory was 229.9MB in the beginning and 206.6MB in the end (delta: 23.3MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23562.39ms. Allocated memory was 264.2MB in the beginning and 1.0GB in the end (delta: 748.7MB). Free memory was 205.6MB in the beginning and 763.6MB in the end (delta: -558.0MB). Peak memory consumption was 190.7MB. Max. memory is 16.1GB. * Witness Printer took 66.25ms. Allocated memory is still 1.0GB. Free memory was 763.6MB in the beginning and 755.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L68] nb = (unsigned char)4 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=155] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=155] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=155] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=155] [L89] COND TRUE i < nb VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=155] [L90] COND TRUE i == (unsigned char)0 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=155] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L89] COND TRUE i < nb VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND TRUE i < na VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] COND TRUE i == (unsigned char)2 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L89] COND TRUE i < nb VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L83] COND TRUE i < na VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] COND TRUE i == (unsigned char)3 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, r0=0, r1=0, r2=0, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, r0=0, r1=0, r2=0, r3=255] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, i=4, r0=0, r1=0, r2=0, r3=255] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r1 << 8U VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r0 | (r1 << 8U) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, r2=0, r3=255] [L116] EXPR r2 << 16U VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, r2=0, r3=255] [L116] r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, r3=255] [L116] r3 << 24U VAL [a0=4043419291, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 132 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 30, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7175 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7175 mSDsluCounter, 13945 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10231 mSDsCounter, 444 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6569 IncrementalHoareTripleChecker+Invalid, 7013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 444 mSolverCounterUnsat, 3714 mSDtfsCounter, 6569 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1930 GetRequests, 1578 SyntacticMatches, 2 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5167 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4431occurred in iteration=20, InterpolantAutomatonStates: 336, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 31227 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 3218 NumberOfCodeBlocks, 3218 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3510 ConstructedInterpolants, 0 QuantifiedInterpolants, 11243 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2380 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 47 InterpolantComputations, 24 PerfectInterpolantSequences, 2718/3223 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-19 10:04:11,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)