./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 20:10:10,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:10:10,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:10:10,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:10:10,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:10:10,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:10:10,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:10:10,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:10:10,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:10:10,587 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:10:10,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:10:10,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:10:10,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:10:10,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:10:10,590 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:10:10,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:10:10,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:10:10,593 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:10:10,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:10:10,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:10:10,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:10:10,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:10:10,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:10:10,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:10:10,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:10:10,595 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:10:10,596 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:10:10,596 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:10:10,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:10:10,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:10:10,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:10:10,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:10:10,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:10:10,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:10:10,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:10:10,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:10:10,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:10:10,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:10:10,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:10:10,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:10:10,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:10:10,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:10:10,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:10:10,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:10:10,601 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-clean/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-clean/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-10-11 20:10:10,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:10:10,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:10:10,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:10:10,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:10:10,854 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:10:10,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i [2024-10-11 20:10:12,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:10:12,452 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:10:12,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i [2024-10-11 20:10:12,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d5df57501/06603fca09f74101aacb882361d2e496/FLAG087b2d236 [2024-10-11 20:10:12,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d5df57501/06603fca09f74101aacb882361d2e496 [2024-10-11 20:10:12,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:10:12,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:10:12,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:10:12,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:10:12,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:10:12,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:10:12" (1/1) ... [2024-10-11 20:10:12,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56e77f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:12, skipping insertion in model container [2024-10-11 20:10:12,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:10:12" (1/1) ... [2024-10-11 20:10:12,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:10:13,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:10:13,174 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:10:13,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:10:13,219 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:10:13,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13 WrapperNode [2024-10-11 20:10:13,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:10:13,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:10:13,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:10:13,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:10:13,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13" (1/1) ... [2024-10-11 20:10:13,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13" (1/1) ... [2024-10-11 20:10:13,294 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 190 [2024-10-11 20:10:13,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:10:13,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:10:13,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:10:13,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:10:13,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13" (1/1) ... [2024-10-11 20:10:13,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13" (1/1) ... [2024-10-11 20:10:13,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13" (1/1) ... [2024-10-11 20:10:13,329 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-10-11 20:10:13,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13" (1/1) ... [2024-10-11 20:10:13,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13" (1/1) ... [2024-10-11 20:10:13,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13" (1/1) ... [2024-10-11 20:10:13,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13" (1/1) ... [2024-10-11 20:10:13,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13" (1/1) ... [2024-10-11 20:10:13,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13" (1/1) ... [2024-10-11 20:10:13,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:10:13,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:10:13,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:10:13,367 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:10:13,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13" (1/1) ... [2024-10-11 20:10:13,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:10:13,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:13,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:10:13,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:10:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:10:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:10:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:10:13,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:10:13,560 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:10:13,562 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:10:13,902 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-10-11 20:10:13,902 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:10:13,930 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:10:13,931 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:10:13,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:13 BoogieIcfgContainer [2024-10-11 20:10:13,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:10:13,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:10:13,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:10:13,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:10:13,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:10:12" (1/3) ... [2024-10-11 20:10:13,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f180256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:10:13, skipping insertion in model container [2024-10-11 20:10:13,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:13" (2/3) ... [2024-10-11 20:10:13,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f180256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:10:13, skipping insertion in model container [2024-10-11 20:10:13,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:13" (3/3) ... [2024-10-11 20:10:13,937 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2024-10-11 20:10:13,949 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:10:13,949 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-10-11 20:10:14,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:10:14,008 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;@748b4db0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:10:14,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-10-11 20:10:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 85 states have (on average 1.9176470588235295) internal successors, (163), 126 states have internal predecessors, (163), 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-10-11 20:10:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:10:14,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:14,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:10:14,018 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-10-11 20:10:14,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:14,022 INFO L85 PathProgramCache]: Analyzing trace with hash 340355, now seen corresponding path program 1 times [2024-10-11 20:10:14,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:14,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285854859] [2024-10-11 20:10:14,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:14,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:14,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285854859] [2024-10-11 20:10:14,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285854859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:14,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:14,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:10:14,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410825542] [2024-10-11 20:10:14,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:14,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:10:14,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:14,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:10:14,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:10:14,166 INFO L87 Difference]: Start difference. First operand has 127 states, 85 states have (on average 1.9176470588235295) internal successors, (163), 126 states have internal predecessors, (163), 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 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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-10-11 20:10:14,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:14,189 INFO L93 Difference]: Finished difference Result 158 states and 217 transitions. [2024-10-11 20:10:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:10:14,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-11 20:10:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:14,200 INFO L225 Difference]: With dead ends: 158 [2024-10-11 20:10:14,200 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 20:10:14,203 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-10-11 20:10:14,208 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:14,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 20:10:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 20:10:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 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-10-11 20:10:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-10-11 20:10:14,309 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 3 [2024-10-11 20:10:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:14,309 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-10-11 20:10:14,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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-10-11 20:10:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-10-11 20:10:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:10:14,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:14,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:10:14,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:10:14,313 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-10-11 20:10:14,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:14,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1455248417, now seen corresponding path program 1 times [2024-10-11 20:10:14,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:14,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571038679] [2024-10-11 20:10:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:14,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:14,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:14,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:14,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571038679] [2024-10-11 20:10:14,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571038679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:14,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:14,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:10:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635814088] [2024-10-11 20:10:14,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:14,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:10:14,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:14,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:10:14,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:14,499 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-11 20:10:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:14,621 INFO L93 Difference]: Finished difference Result 164 states and 239 transitions. [2024-10-11 20:10:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:10:14,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-10-11 20:10:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:14,622 INFO L225 Difference]: With dead ends: 164 [2024-10-11 20:10:14,623 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 20:10:14,623 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-10-11 20:10:14,625 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:14,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 146 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:10:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 20:10:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2024-10-11 20:10:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 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-10-11 20:10:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2024-10-11 20:10:14,633 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 18 [2024-10-11 20:10:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:14,633 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2024-10-11 20:10:14,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-11 20:10:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2024-10-11 20:10:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:10:14,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:14,635 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] [2024-10-11 20:10:14,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:10:14,635 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-10-11 20:10:14,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash 523859999, now seen corresponding path program 1 times [2024-10-11 20:10:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:14,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370278575] [2024-10-11 20:10:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:14,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:14,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370278575] [2024-10-11 20:10:14,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370278575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:14,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:14,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:10:14,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626334828] [2024-10-11 20:10:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:14,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:10:14,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:14,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:10:14,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:10:14,749 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:14,954 INFO L93 Difference]: Finished difference Result 233 states and 344 transitions. [2024-10-11 20:10:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:10:14,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 20:10:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:14,956 INFO L225 Difference]: With dead ends: 233 [2024-10-11 20:10:14,956 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 20:10:14,956 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-10-11 20:10:14,957 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 114 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:14,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 201 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:10:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 20:10:14,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 128. [2024-10-11 20:10:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 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-10-11 20:10:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2024-10-11 20:10:14,965 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 25 [2024-10-11 20:10:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:14,966 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2024-10-11 20:10:14,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2024-10-11 20:10:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 20:10:14,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:14,967 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] [2024-10-11 20:10:14,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:10:14,967 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-10-11 20:10:14,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:14,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2019585051, now seen corresponding path program 1 times [2024-10-11 20:10:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:14,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133083462] [2024-10-11 20:10:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:14,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:10:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:15,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133083462] [2024-10-11 20:10:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133083462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:10:15,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878304895] [2024-10-11 20:10:15,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:15,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:10:15,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:15,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:10:15,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:10:15,073 INFO L87 Difference]: Start difference. First operand 128 states and 174 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-10-11 20:10:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:15,184 INFO L93 Difference]: Finished difference Result 334 states and 453 transitions. [2024-10-11 20:10:15,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:10:15,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 32 [2024-10-11 20:10:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:15,186 INFO L225 Difference]: With dead ends: 334 [2024-10-11 20:10:15,186 INFO L226 Difference]: Without dead ends: 230 [2024-10-11 20:10:15,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-11 20:10:15,188 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 110 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:15,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 306 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:10:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-11 20:10:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 141. [2024-10-11 20:10:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.3571428571428572) internal successors, (190), 140 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-10-11 20:10:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 190 transitions. [2024-10-11 20:10:15,197 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 190 transitions. Word has length 32 [2024-10-11 20:10:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:15,198 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 190 transitions. [2024-10-11 20:10:15,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-10-11 20:10:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 190 transitions. [2024-10-11 20:10:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:10:15,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:15,200 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] [2024-10-11 20:10:15,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:10:15,200 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-10-11 20:10:15,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1965153963, now seen corresponding path program 1 times [2024-10-11 20:10:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:15,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536333780] [2024-10-11 20:10:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:10:15,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:15,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536333780] [2024-10-11 20:10:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536333780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:15,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:15,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:10:15,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453650585] [2024-10-11 20:10:15,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:15,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:10:15,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:15,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:10:15,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:10:15,404 INFO L87 Difference]: Start difference. First operand 141 states and 190 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-10-11 20:10:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:15,544 INFO L93 Difference]: Finished difference Result 340 states and 459 transitions. [2024-10-11 20:10:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:10:15,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 35 [2024-10-11 20:10:15,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:15,546 INFO L225 Difference]: With dead ends: 340 [2024-10-11 20:10:15,546 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 20:10:15,549 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-10-11 20:10:15,551 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 99 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:15,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 296 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:10:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 20:10:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 154. [2024-10-11 20:10:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.3333333333333333) internal successors, (204), 153 states have internal predecessors, (204), 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-10-11 20:10:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 204 transitions. [2024-10-11 20:10:15,571 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 204 transitions. Word has length 35 [2024-10-11 20:10:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:15,572 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 204 transitions. [2024-10-11 20:10:15,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-10-11 20:10:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2024-10-11 20:10:15,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:10:15,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:15,574 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] [2024-10-11 20:10:15,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:10:15,575 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-10-11 20:10:15,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:15,575 INFO L85 PathProgramCache]: Analyzing trace with hash 297615360, now seen corresponding path program 1 times [2024-10-11 20:10:15,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:15,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236242559] [2024-10-11 20:10:15,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:15,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:15,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:15,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236242559] [2024-10-11 20:10:15,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236242559] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:10:15,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311062510] [2024-10-11 20:10:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:15,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:15,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:15,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:10:15,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:10:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:15,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:10:15,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:10:15,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:10:15,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311062510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:15,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:10:15,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 20:10:15,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620184913] [2024-10-11 20:10:15,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:15,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:10:15,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:15,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:10:15,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:10:15,851 INFO L87 Difference]: Start difference. First operand 154 states and 204 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-10-11 20:10:15,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:15,862 INFO L93 Difference]: Finished difference Result 256 states and 344 transitions. [2024-10-11 20:10:15,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:10:15,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 38 [2024-10-11 20:10:15,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:15,864 INFO L225 Difference]: With dead ends: 256 [2024-10-11 20:10:15,864 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 20:10:15,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:10:15,865 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 94 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-10-11 20:10:15,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 20:10:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-10-11 20:10:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.3359375) internal successors, (171), 128 states have internal predecessors, (171), 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-10-11 20:10:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 171 transitions. [2024-10-11 20:10:15,886 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 171 transitions. Word has length 38 [2024-10-11 20:10:15,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:15,887 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 171 transitions. [2024-10-11 20:10:15,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-10-11 20:10:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 171 transitions. [2024-10-11 20:10:15,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 20:10:15,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:15,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:10:15,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:10:16,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:16,093 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-10-11 20:10:16,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1662927508, now seen corresponding path program 1 times [2024-10-11 20:10:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30615267] [2024-10-11 20:10:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:16,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:10:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30615267] [2024-10-11 20:10:16,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30615267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:16,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:16,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:10:16,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985331931] [2024-10-11 20:10:16,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:16,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:10:16,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:16,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:10:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:16,220 INFO L87 Difference]: Start difference. First operand 129 states and 171 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-10-11 20:10:16,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:16,237 INFO L93 Difference]: Finished difference Result 180 states and 240 transitions. [2024-10-11 20:10:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:10:16,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2024-10-11 20:10:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:16,238 INFO L225 Difference]: With dead ends: 180 [2024-10-11 20:10:16,238 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 20:10:16,238 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-10-11 20:10:16,239 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 4 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:16,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 20:10:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-11 20:10:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 146 states have internal predecessors, (195), 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-10-11 20:10:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 195 transitions. [2024-10-11 20:10:16,251 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 195 transitions. Word has length 44 [2024-10-11 20:10:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:16,251 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 195 transitions. [2024-10-11 20:10:16,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-10-11 20:10:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 195 transitions. [2024-10-11 20:10:16,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 20:10:16,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:16,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:10:16,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:10:16,259 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-10-11 20:10:16,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:16,260 INFO L85 PathProgramCache]: Analyzing trace with hash -708811754, now seen corresponding path program 1 times [2024-10-11 20:10:16,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:16,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392856868] [2024-10-11 20:10:16,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:10:16,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:16,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392856868] [2024-10-11 20:10:16,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392856868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:16,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:16,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:10:16,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987808493] [2024-10-11 20:10:16,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:16,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:10:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:16,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:10:16,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:10:16,423 INFO L87 Difference]: Start difference. First operand 147 states and 195 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-10-11 20:10:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:16,620 INFO L93 Difference]: Finished difference Result 398 states and 561 transitions. [2024-10-11 20:10:16,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:10:16,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2024-10-11 20:10:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:16,622 INFO L225 Difference]: With dead ends: 398 [2024-10-11 20:10:16,622 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 20:10:16,622 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-10-11 20:10:16,622 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 130 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:16,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 159 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:10:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 20:10:16,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 195. [2024-10-11 20:10:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.3917525773195876) internal successors, (270), 194 states have internal predecessors, (270), 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-10-11 20:10:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 270 transitions. [2024-10-11 20:10:16,630 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 270 transitions. Word has length 44 [2024-10-11 20:10:16,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:16,631 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 270 transitions. [2024-10-11 20:10:16,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-10-11 20:10:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 270 transitions. [2024-10-11 20:10:16,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 20:10:16,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:16,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:10:16,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:10:16,633 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-10-11 20:10:16,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:16,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1270705288, now seen corresponding path program 1 times [2024-10-11 20:10:16,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:16,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137545628] [2024-10-11 20:10:16,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:16,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:10:16,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137545628] [2024-10-11 20:10:16,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137545628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:10:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974870197] [2024-10-11 20:10:16,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:16,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:16,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:16,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:10:16,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:10:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:16,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:10:16,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:10:16,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:10:16,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974870197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:16,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:10:16,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-10-11 20:10:16,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607399878] [2024-10-11 20:10:16,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:16,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:10:16,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:16,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:10:16,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:10:16,855 INFO L87 Difference]: Start difference. First operand 195 states and 270 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-10-11 20:10:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:16,980 INFO L93 Difference]: Finished difference Result 432 states and 630 transitions. [2024-10-11 20:10:16,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:10:16,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 51 [2024-10-11 20:10:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:16,981 INFO L225 Difference]: With dead ends: 432 [2024-10-11 20:10:16,981 INFO L226 Difference]: Without dead ends: 264 [2024-10-11 20:10:16,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:10:16,983 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 47 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:16,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 210 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:10:16,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-11 20:10:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 238. [2024-10-11 20:10:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.3459915611814346) internal successors, (319), 237 states have internal predecessors, (319), 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-10-11 20:10:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 319 transitions. [2024-10-11 20:10:16,991 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 319 transitions. Word has length 51 [2024-10-11 20:10:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:16,992 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 319 transitions. [2024-10-11 20:10:16,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-10-11 20:10:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 319 transitions. [2024-10-11 20:10:16,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 20:10:16,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:16,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:10:17,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:10:17,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:17,194 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-10-11 20:10:17,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash -365279470, now seen corresponding path program 1 times [2024-10-11 20:10:17,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:17,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8738497] [2024-10-11 20:10:17,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:17,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 20:10:17,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:17,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8738497] [2024-10-11 20:10:17,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8738497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:17,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:17,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:10:17,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603148256] [2024-10-11 20:10:17,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:17,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:10:17,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:17,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:10:17,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:17,294 INFO L87 Difference]: Start difference. First operand 238 states and 319 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 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-10-11 20:10:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:17,309 INFO L93 Difference]: Finished difference Result 285 states and 379 transitions. [2024-10-11 20:10:17,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:10:17,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 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 58 [2024-10-11 20:10:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:17,314 INFO L225 Difference]: With dead ends: 285 [2024-10-11 20:10:17,314 INFO L226 Difference]: Without dead ends: 214 [2024-10-11 20:10:17,314 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-10-11 20:10:17,315 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:17,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 200 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-11 20:10:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 188. [2024-10-11 20:10:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.3368983957219251) internal successors, (250), 187 states have internal predecessors, (250), 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-10-11 20:10:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 250 transitions. [2024-10-11 20:10:17,321 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 250 transitions. Word has length 58 [2024-10-11 20:10:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:17,322 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 250 transitions. [2024-10-11 20:10:17,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 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-10-11 20:10:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 250 transitions. [2024-10-11 20:10:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 20:10:17,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:17,322 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2024-10-11 20:10:17,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:10:17,322 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-10-11 20:10:17,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:17,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1976222935, now seen corresponding path program 1 times [2024-10-11 20:10:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:17,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001732884] [2024-10-11 20:10:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:10:17,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:17,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001732884] [2024-10-11 20:10:17,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001732884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:17,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:17,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:10:17,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42786572] [2024-10-11 20:10:17,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:17,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:10:17,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:17,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:10:17,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:10:17,503 INFO L87 Difference]: Start difference. First operand 188 states and 250 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-10-11 20:10:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:17,571 INFO L93 Difference]: Finished difference Result 508 states and 687 transitions. [2024-10-11 20:10:17,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:10:17,572 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 67 [2024-10-11 20:10:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:17,573 INFO L225 Difference]: With dead ends: 508 [2024-10-11 20:10:17,573 INFO L226 Difference]: Without dead ends: 347 [2024-10-11 20:10:17,573 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-10-11 20:10:17,573 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 68 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:17,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 348 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:10:17,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-11 20:10:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 257. [2024-10-11 20:10:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.390625) internal successors, (356), 256 states have internal predecessors, (356), 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-10-11 20:10:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 356 transitions. [2024-10-11 20:10:17,610 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 356 transitions. Word has length 67 [2024-10-11 20:10:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:17,612 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 356 transitions. [2024-10-11 20:10:17,612 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-10-11 20:10:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 356 transitions. [2024-10-11 20:10:17,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 20:10:17,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:17,613 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2024-10-11 20:10:17,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:10:17,613 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-10-11 20:10:17,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:17,614 INFO L85 PathProgramCache]: Analyzing trace with hash 946937063, now seen corresponding path program 2 times [2024-10-11 20:10:17,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:17,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783600540] [2024-10-11 20:10:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:10:17,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783600540] [2024-10-11 20:10:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783600540] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:10:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478449438] [2024-10-11 20:10:17,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:10:17,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:17,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:17,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:10:17,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:10:17,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:10:17,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:10:17,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 20:10:17,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:10:18,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:10:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 41 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:10:18,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478449438] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:10:18,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:10:18,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 7 [2024-10-11 20:10:18,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645386887] [2024-10-11 20:10:18,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:10:18,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:10:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:18,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:10:18,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:10:18,167 INFO L87 Difference]: Start difference. First operand 257 states and 356 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-10-11 20:10:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:18,325 INFO L93 Difference]: Finished difference Result 582 states and 804 transitions. [2024-10-11 20:10:18,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:10:18,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 67 [2024-10-11 20:10:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:18,327 INFO L225 Difference]: With dead ends: 582 [2024-10-11 20:10:18,327 INFO L226 Difference]: Without dead ends: 352 [2024-10-11 20:10:18,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:10:18,327 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 173 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:18,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 250 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:10:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-11 20:10:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 256. [2024-10-11 20:10:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.3725490196078431) internal successors, (350), 255 states have internal predecessors, (350), 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-10-11 20:10:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 350 transitions. [2024-10-11 20:10:18,335 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 350 transitions. Word has length 67 [2024-10-11 20:10:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:18,335 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 350 transitions. [2024-10-11 20:10:18,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-10-11 20:10:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 350 transitions. [2024-10-11 20:10:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 20:10:18,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:18,336 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] [2024-10-11 20:10:18,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:10:18,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:18,541 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-10-11 20:10:18,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:18,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1789913269, now seen corresponding path program 1 times [2024-10-11 20:10:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:18,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649999295] [2024-10-11 20:10:18,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:18,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 20:10:18,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:18,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649999295] [2024-10-11 20:10:18,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649999295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:18,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:18,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:10:18,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38836011] [2024-10-11 20:10:18,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:18,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:10:18,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:18,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:10:18,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:10:18,655 INFO L87 Difference]: Start difference. First operand 256 states and 350 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-10-11 20:10:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:18,835 INFO L93 Difference]: Finished difference Result 776 states and 1064 transitions. [2024-10-11 20:10:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:10:18,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 73 [2024-10-11 20:10:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:18,837 INFO L225 Difference]: With dead ends: 776 [2024-10-11 20:10:18,837 INFO L226 Difference]: Without dead ends: 544 [2024-10-11 20:10:18,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:10:18,838 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 121 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:18,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 276 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:10:18,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-10-11 20:10:18,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 450. [2024-10-11 20:10:18,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.3741648106904232) internal successors, (617), 449 states have internal predecessors, (617), 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-10-11 20:10:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 617 transitions. [2024-10-11 20:10:18,848 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 617 transitions. Word has length 73 [2024-10-11 20:10:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:18,849 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 617 transitions. [2024-10-11 20:10:18,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-10-11 20:10:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 617 transitions. [2024-10-11 20:10:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 20:10:18,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:18,850 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] [2024-10-11 20:10:18,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:10:18,850 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-10-11 20:10:18,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1765087641, now seen corresponding path program 1 times [2024-10-11 20:10:18,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:18,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070491561] [2024-10-11 20:10:18,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 20:10:18,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:18,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070491561] [2024-10-11 20:10:18,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070491561] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:10:18,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969535027] [2024-10-11 20:10:18,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:18,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:18,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:18,904 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:10:18,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:10:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:18,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:10:18,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 20:10:18,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:10:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969535027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:18,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:10:18,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-10-11 20:10:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999138169] [2024-10-11 20:10:18,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:18,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:10:18,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:10:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:10:18,993 INFO L87 Difference]: Start difference. First operand 450 states and 617 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-11 20:10:19,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:19,069 INFO L93 Difference]: Finished difference Result 1193 states and 1632 transitions. [2024-10-11 20:10:19,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:10:19,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 73 [2024-10-11 20:10:19,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:19,072 INFO L225 Difference]: With dead ends: 1193 [2024-10-11 20:10:19,072 INFO L226 Difference]: Without dead ends: 728 [2024-10-11 20:10:19,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:10:19,073 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 37 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:19,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 221 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:10:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-11 20:10:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 634. [2024-10-11 20:10:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.3570300157977884) internal successors, (859), 633 states have internal predecessors, (859), 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-10-11 20:10:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 859 transitions. [2024-10-11 20:10:19,087 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 859 transitions. Word has length 73 [2024-10-11 20:10:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:19,087 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 859 transitions. [2024-10-11 20:10:19,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-11 20:10:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 859 transitions. [2024-10-11 20:10:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 20:10:19,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:19,089 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1] [2024-10-11 20:10:19,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:10:19,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:10:19,290 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-10-11 20:10:19,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:19,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1893094289, now seen corresponding path program 1 times [2024-10-11 20:10:19,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:19,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322421584] [2024-10-11 20:10:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:19,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 20:10:19,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:19,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322421584] [2024-10-11 20:10:19,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322421584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:19,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:19,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:10:19,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920542257] [2024-10-11 20:10:19,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:19,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:10:19,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:19,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:10:19,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:10:19,398 INFO L87 Difference]: Start difference. First operand 634 states and 859 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-10-11 20:10:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:19,598 INFO L93 Difference]: Finished difference Result 1574 states and 2110 transitions. [2024-10-11 20:10:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:10:19,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 76 [2024-10-11 20:10:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:19,601 INFO L225 Difference]: With dead ends: 1574 [2024-10-11 20:10:19,601 INFO L226 Difference]: Without dead ends: 921 [2024-10-11 20:10:19,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:10:19,603 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 214 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:19,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 187 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:10:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-10-11 20:10:19,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 792. [2024-10-11 20:10:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 1.345132743362832) internal successors, (1064), 791 states have internal predecessors, (1064), 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-10-11 20:10:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1064 transitions. [2024-10-11 20:10:19,628 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1064 transitions. Word has length 76 [2024-10-11 20:10:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:19,629 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1064 transitions. [2024-10-11 20:10:19,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-10-11 20:10:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1064 transitions. [2024-10-11 20:10:19,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 20:10:19,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:19,630 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] [2024-10-11 20:10:19,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 20:10:19,631 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-10-11 20:10:19,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:19,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1973722739, now seen corresponding path program 1 times [2024-10-11 20:10:19,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:19,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119718067] [2024-10-11 20:10:19,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:19,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 20:10:19,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:19,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119718067] [2024-10-11 20:10:19,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119718067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:19,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:19,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 20:10:19,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346874542] [2024-10-11 20:10:19,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:19,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:10:19,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:19,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:10:19,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:10:19,734 INFO L87 Difference]: Start difference. First operand 792 states and 1064 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-10-11 20:10:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:20,003 INFO L93 Difference]: Finished difference Result 2190 states and 2930 transitions. [2024-10-11 20:10:20,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:10:20,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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 79 [2024-10-11 20:10:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:20,006 INFO L225 Difference]: With dead ends: 2190 [2024-10-11 20:10:20,006 INFO L226 Difference]: Without dead ends: 1222 [2024-10-11 20:10:20,008 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-10-11 20:10:20,008 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 146 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:20,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 340 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:10:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2024-10-11 20:10:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 961. [2024-10-11 20:10:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 960 states have (on average 1.3197916666666667) internal successors, (1267), 960 states have internal predecessors, (1267), 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-10-11 20:10:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1267 transitions. [2024-10-11 20:10:20,030 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1267 transitions. Word has length 79 [2024-10-11 20:10:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:20,030 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1267 transitions. [2024-10-11 20:10:20,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-10-11 20:10:20,031 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1267 transitions. [2024-10-11 20:10:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 20:10:20,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:20,032 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] [2024-10-11 20:10:20,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 20:10:20,032 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-10-11 20:10:20,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:20,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1124026941, now seen corresponding path program 1 times [2024-10-11 20:10:20,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:20,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998488588] [2024-10-11 20:10:20,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 20:10:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998488588] [2024-10-11 20:10:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998488588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:10:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581392664] [2024-10-11 20:10:20,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:20,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:20,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:20,122 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:10:20,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:10:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:20,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 20:10:20,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 20:10:20,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:10:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 20:10:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581392664] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:10:20,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:10:20,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2024-10-11 20:10:20,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390827150] [2024-10-11 20:10:20,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:10:20,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:10:20,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:20,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:10:20,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:10:20,295 INFO L87 Difference]: Start difference. First operand 961 states and 1267 transitions. Second operand has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 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-10-11 20:10:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:21,516 INFO L93 Difference]: Finished difference Result 5545 states and 7132 transitions. [2024-10-11 20:10:21,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-11 20:10:21,517 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 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 79 [2024-10-11 20:10:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:21,526 INFO L225 Difference]: With dead ends: 5545 [2024-10-11 20:10:21,526 INFO L226 Difference]: Without dead ends: 4430 [2024-10-11 20:10:21,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=592, Invalid=2600, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 20:10:21,528 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 844 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:21,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1221 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 20:10:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4430 states. [2024-10-11 20:10:21,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4430 to 1220. [2024-10-11 20:10:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 1219 states have (on average 1.432321575061526) internal successors, (1746), 1219 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-10-11 20:10:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1746 transitions. [2024-10-11 20:10:21,574 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1746 transitions. Word has length 79 [2024-10-11 20:10:21,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:21,575 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1746 transitions. [2024-10-11 20:10:21,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 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-10-11 20:10:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1746 transitions. [2024-10-11 20:10:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 20:10:21,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:21,577 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1] [2024-10-11 20:10:21,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:10:21,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 20:10:21,782 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-10-11 20:10:21,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1487673427, now seen corresponding path program 1 times [2024-10-11 20:10:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:21,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520940728] [2024-10-11 20:10:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 20:10:21,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:21,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520940728] [2024-10-11 20:10:21,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520940728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:21,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:21,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 20:10:21,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414141545] [2024-10-11 20:10:21,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:21,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:10:21,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:21,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:10:21,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:10:21,986 INFO L87 Difference]: Start difference. First operand 1220 states and 1746 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 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-10-11 20:10:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:22,258 INFO L93 Difference]: Finished difference Result 2814 states and 3998 transitions. [2024-10-11 20:10:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:10:22,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 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 82 [2024-10-11 20:10:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:22,262 INFO L225 Difference]: With dead ends: 2814 [2024-10-11 20:10:22,262 INFO L226 Difference]: Without dead ends: 1550 [2024-10-11 20:10:22,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:10:22,263 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 269 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:22,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 218 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:10:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2024-10-11 20:10:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1454. [2024-10-11 20:10:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1453 states have (on average 1.4211975223675155) internal successors, (2065), 1453 states have internal predecessors, (2065), 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-10-11 20:10:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2065 transitions. [2024-10-11 20:10:22,297 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2065 transitions. Word has length 82 [2024-10-11 20:10:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:22,298 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 2065 transitions. [2024-10-11 20:10:22,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 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-10-11 20:10:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2065 transitions. [2024-10-11 20:10:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 20:10:22,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:22,299 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] [2024-10-11 20:10:22,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 20:10:22,299 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-10-11 20:10:22,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1520902403, now seen corresponding path program 1 times [2024-10-11 20:10:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:22,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217404578] [2024-10-11 20:10:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-11 20:10:22,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:22,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217404578] [2024-10-11 20:10:22,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217404578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:22,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:22,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:10:22,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387138434] [2024-10-11 20:10:22,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:22,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:10:22,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:22,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:10:22,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:10:22,415 INFO L87 Difference]: Start difference. First operand 1454 states and 2065 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-10-11 20:10:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:22,621 INFO L93 Difference]: Finished difference Result 4513 states and 6409 transitions. [2024-10-11 20:10:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:10:22,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 85 [2024-10-11 20:10:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:22,631 INFO L225 Difference]: With dead ends: 4513 [2024-10-11 20:10:22,631 INFO L226 Difference]: Without dead ends: 4303 [2024-10-11 20:10:22,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:10:22,633 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 193 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:22,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 416 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:10:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2024-10-11 20:10:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 1454. [2024-10-11 20:10:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1453 states have (on average 1.4211975223675155) internal successors, (2065), 1453 states have internal predecessors, (2065), 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-10-11 20:10:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2065 transitions. [2024-10-11 20:10:22,731 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2065 transitions. Word has length 85 [2024-10-11 20:10:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:22,731 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 2065 transitions. [2024-10-11 20:10:22,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-10-11 20:10:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2065 transitions. [2024-10-11 20:10:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 20:10:22,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:22,734 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] [2024-10-11 20:10:22,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 20:10:22,735 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-10-11 20:10:22,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1059732260, now seen corresponding path program 1 times [2024-10-11 20:10:22,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:22,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472317638] [2024-10-11 20:10:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:22,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-11 20:10:22,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:22,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472317638] [2024-10-11 20:10:22,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472317638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:22,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:22,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:10:22,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090501652] [2024-10-11 20:10:22,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:22,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:10:22,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:22,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:10:22,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:10:22,874 INFO L87 Difference]: Start difference. First operand 1454 states and 2065 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-10-11 20:10:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:22,985 INFO L93 Difference]: Finished difference Result 3454 states and 4708 transitions. [2024-10-11 20:10:22,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:10:22,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 88 [2024-10-11 20:10:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:22,990 INFO L225 Difference]: With dead ends: 3454 [2024-10-11 20:10:22,990 INFO L226 Difference]: Without dead ends: 2029 [2024-10-11 20:10:22,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:10:22,993 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 254 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:22,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 329 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2024-10-11 20:10:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1493. [2024-10-11 20:10:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1492 states have (on average 1.3150134048257374) internal successors, (1962), 1492 states have internal predecessors, (1962), 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-10-11 20:10:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1962 transitions. [2024-10-11 20:10:23,041 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1962 transitions. Word has length 88 [2024-10-11 20:10:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:23,041 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1962 transitions. [2024-10-11 20:10:23,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-10-11 20:10:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1962 transitions. [2024-10-11 20:10:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 20:10:23,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:23,043 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] [2024-10-11 20:10:23,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 20:10:23,043 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-10-11 20:10:23,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:23,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1038181142, now seen corresponding path program 1 times [2024-10-11 20:10:23,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:23,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889230498] [2024-10-11 20:10:23,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:23,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-11 20:10:23,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:23,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889230498] [2024-10-11 20:10:23,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889230498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:23,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:23,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:10:23,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105780664] [2024-10-11 20:10:23,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:23,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:10:23,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:23,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:10:23,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:10:23,177 INFO L87 Difference]: Start difference. First operand 1493 states and 1962 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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-10-11 20:10:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:23,517 INFO L93 Difference]: Finished difference Result 6033 states and 7923 transitions. [2024-10-11 20:10:23,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:10:23,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 88 [2024-10-11 20:10:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:23,529 INFO L225 Difference]: With dead ends: 6033 [2024-10-11 20:10:23,530 INFO L226 Difference]: Without dead ends: 5904 [2024-10-11 20:10:23,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:10:23,531 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 290 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:23,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 577 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:10:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5904 states. [2024-10-11 20:10:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5904 to 1493. [2024-10-11 20:10:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1492 states have (on average 1.3150134048257374) internal successors, (1962), 1492 states have internal predecessors, (1962), 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-10-11 20:10:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1962 transitions. [2024-10-11 20:10:23,589 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1962 transitions. Word has length 88 [2024-10-11 20:10:23,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:23,590 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1962 transitions. [2024-10-11 20:10:23,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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-10-11 20:10:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1962 transitions. [2024-10-11 20:10:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 20:10:23,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:23,610 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] [2024-10-11 20:10:23,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 20:10:23,610 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-10-11 20:10:23,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash 875112187, now seen corresponding path program 1 times [2024-10-11 20:10:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:23,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786828220] [2024-10-11 20:10:23,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-11 20:10:23,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:23,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786828220] [2024-10-11 20:10:23,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786828220] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:10:23,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439263992] [2024-10-11 20:10:23,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:23,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:23,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:23,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:10:23,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:10:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:23,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:10:23,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 20:10:23,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:10:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 20:10:23,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439263992] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:10:23,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:10:23,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 5] total 10 [2024-10-11 20:10:23,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281199676] [2024-10-11 20:10:23,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:10:23,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:10:23,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:23,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:10:23,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:10:23,888 INFO L87 Difference]: Start difference. First operand 1493 states and 1962 transitions. Second operand has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 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-10-11 20:10:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:24,546 INFO L93 Difference]: Finished difference Result 5119 states and 6929 transitions. [2024-10-11 20:10:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 20:10:24,546 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 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 88 [2024-10-11 20:10:24,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:24,554 INFO L225 Difference]: With dead ends: 5119 [2024-10-11 20:10:24,554 INFO L226 Difference]: Without dead ends: 3587 [2024-10-11 20:10:24,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:10:24,556 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 471 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:24,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 418 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:10:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3587 states. [2024-10-11 20:10:24,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3587 to 2994. [2024-10-11 20:10:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2994 states, 2993 states have (on average 1.2372201804209824) internal successors, (3703), 2993 states have internal predecessors, (3703), 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-10-11 20:10:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 3703 transitions. [2024-10-11 20:10:24,752 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 3703 transitions. Word has length 88 [2024-10-11 20:10:24,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:24,752 INFO L471 AbstractCegarLoop]: Abstraction has 2994 states and 3703 transitions. [2024-10-11 20:10:24,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 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-10-11 20:10:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 3703 transitions. [2024-10-11 20:10:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 20:10:24,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:24,758 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] [2024-10-11 20:10:24,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:10:24,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 20:10:24,959 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-10-11 20:10:24,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:24,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1946046407, now seen corresponding path program 1 times [2024-10-11 20:10:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:24,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575422032] [2024-10-11 20:10:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:24,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 20:10:25,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:25,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575422032] [2024-10-11 20:10:25,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575422032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:10:25,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425245882] [2024-10-11 20:10:25,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:25,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:25,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:25,147 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:10:25,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:10:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:25,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:10:25,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 20:10:25,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:10:25,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425245882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:25,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:10:25,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-11 20:10:25,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992063258] [2024-10-11 20:10:25,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:25,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:10:25,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:25,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:10:25,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:10:25,291 INFO L87 Difference]: Start difference. First operand 2994 states and 3703 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-10-11 20:10:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:25,519 INFO L93 Difference]: Finished difference Result 3390 states and 4157 transitions. [2024-10-11 20:10:25,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:10:25,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 88 [2024-10-11 20:10:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:25,528 INFO L225 Difference]: With dead ends: 3390 [2024-10-11 20:10:25,534 INFO L226 Difference]: Without dead ends: 2650 [2024-10-11 20:10:25,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 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-10-11 20:10:25,536 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 45 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:25,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 139 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:10:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2024-10-11 20:10:25,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2492. [2024-10-11 20:10:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2491 states have (on average 1.2416700120433561) internal successors, (3093), 2491 states have internal predecessors, (3093), 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-10-11 20:10:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 3093 transitions. [2024-10-11 20:10:25,729 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 3093 transitions. Word has length 88 [2024-10-11 20:10:25,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:25,729 INFO L471 AbstractCegarLoop]: Abstraction has 2492 states and 3093 transitions. [2024-10-11 20:10:25,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-10-11 20:10:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 3093 transitions. [2024-10-11 20:10:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 20:10:25,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:25,730 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] [2024-10-11 20:10:25,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:10:25,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:25,934 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-10-11 20:10:25,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash 275583794, now seen corresponding path program 1 times [2024-10-11 20:10:25,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:25,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421749500] [2024-10-11 20:10:25,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:26,237 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 43 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 20:10:26,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:26,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421749500] [2024-10-11 20:10:26,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421749500] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:10:26,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657841997] [2024-10-11 20:10:26,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:26,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:26,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:26,241 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:10:26,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:10:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:26,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 20:10:26,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-11 20:10:26,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:10:26,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657841997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:26,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:10:26,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2024-10-11 20:10:26,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478731659] [2024-10-11 20:10:26,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:26,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:10:26,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:26,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:10:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:10:26,481 INFO L87 Difference]: Start difference. First operand 2492 states and 3093 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 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-10-11 20:10:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:26,975 INFO L93 Difference]: Finished difference Result 7358 states and 9182 transitions. [2024-10-11 20:10:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:10:26,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 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-10-11 20:10:26,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:26,986 INFO L225 Difference]: With dead ends: 7358 [2024-10-11 20:10:26,987 INFO L226 Difference]: Without dead ends: 4899 [2024-10-11 20:10:26,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:10:26,990 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 352 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:26,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 831 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:10:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2024-10-11 20:10:27,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 2225. [2024-10-11 20:10:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 2224 states have (on average 1.22886690647482) internal successors, (2733), 2224 states have internal predecessors, (2733), 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-10-11 20:10:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2733 transitions. [2024-10-11 20:10:27,081 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2733 transitions. Word has length 90 [2024-10-11 20:10:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:27,082 INFO L471 AbstractCegarLoop]: Abstraction has 2225 states and 2733 transitions. [2024-10-11 20:10:27,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 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-10-11 20:10:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2733 transitions. [2024-10-11 20:10:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 20:10:27,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:27,084 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, 1, 1, 1, 1, 1] [2024-10-11 20:10:27,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:10:27,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 20:10:27,289 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-10-11 20:10:27,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:27,290 INFO L85 PathProgramCache]: Analyzing trace with hash -736197810, now seen corresponding path program 1 times [2024-10-11 20:10:27,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:27,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082616471] [2024-10-11 20:10:27,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:27,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 20:10:27,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:27,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082616471] [2024-10-11 20:10:27,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082616471] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:10:27,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568136477] [2024-10-11 20:10:27,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:27,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:27,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:27,458 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:10:27,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:10:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:27,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 20:10:27,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 33 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 20:10:27,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:10:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 20:10:27,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568136477] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:10:27,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:10:27,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2024-10-11 20:10:27,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749576214] [2024-10-11 20:10:27,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:10:27,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 20:10:27,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:27,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 20:10:27,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:10:27,983 INFO L87 Difference]: Start difference. First operand 2225 states and 2733 transitions. Second operand has 18 states, 18 states have (on average 13.055555555555555) internal successors, (235), 17 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-10-11 20:10:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:33,877 INFO L93 Difference]: Finished difference Result 14815 states and 17742 transitions. [2024-10-11 20:10:33,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2024-10-11 20:10:33,877 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 13.055555555555555) internal successors, (235), 17 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) Word has length 94 [2024-10-11 20:10:33,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:33,890 INFO L225 Difference]: With dead ends: 14815 [2024-10-11 20:10:33,890 INFO L226 Difference]: Without dead ends: 9223 [2024-10-11 20:10:33,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8882 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3115, Invalid=21377, Unknown=0, NotChecked=0, Total=24492 [2024-10-11 20:10:33,898 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 2016 mSDsluCounter, 3270 mSDsCounter, 0 mSdLazyCounter, 5879 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2016 SdHoareTripleChecker+Valid, 3727 SdHoareTripleChecker+Invalid, 5934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 5879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:33,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2016 Valid, 3727 Invalid, 5934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 5879 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 20:10:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2024-10-11 20:10:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 1464. [2024-10-11 20:10:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 1.2303485987696514) internal successors, (1800), 1463 states have internal predecessors, (1800), 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-10-11 20:10:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1800 transitions. [2024-10-11 20:10:33,984 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 1800 transitions. Word has length 94 [2024-10-11 20:10:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:33,984 INFO L471 AbstractCegarLoop]: Abstraction has 1464 states and 1800 transitions. [2024-10-11 20:10:33,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.055555555555555) internal successors, (235), 17 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-10-11 20:10:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1800 transitions. [2024-10-11 20:10:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 20:10:33,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:33,986 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] [2024-10-11 20:10:33,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:10:34,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:34,188 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-10-11 20:10:34,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:34,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1670402701, now seen corresponding path program 1 times [2024-10-11 20:10:34,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:34,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199920087] [2024-10-11 20:10:34,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:34,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:10:34,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:34,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199920087] [2024-10-11 20:10:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199920087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:10:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875722916] [2024-10-11 20:10:34,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:34,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:34,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:34,331 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:10:34,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:10:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:34,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:10:34,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 20:10:34,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:10:34,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875722916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:34,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:10:34,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-10-11 20:10:34,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944162914] [2024-10-11 20:10:34,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:34,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:10:34,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:34,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:10:34,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:10:34,486 INFO L87 Difference]: Start difference. First operand 1464 states and 1800 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-10-11 20:10:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:34,602 INFO L93 Difference]: Finished difference Result 1999 states and 2423 transitions. [2024-10-11 20:10:34,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:10:34,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 94 [2024-10-11 20:10:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:34,605 INFO L225 Difference]: With dead ends: 1999 [2024-10-11 20:10:34,605 INFO L226 Difference]: Without dead ends: 1188 [2024-10-11 20:10:34,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 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-10-11 20:10:34,607 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 50 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:34,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 101 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:10:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2024-10-11 20:10:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1105. [2024-10-11 20:10:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1104 states have (on average 1.2309782608695652) internal successors, (1359), 1104 states have internal predecessors, (1359), 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-10-11 20:10:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1359 transitions. [2024-10-11 20:10:34,643 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1359 transitions. Word has length 94 [2024-10-11 20:10:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:34,644 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1359 transitions. [2024-10-11 20:10:34,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-10-11 20:10:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1359 transitions. [2024-10-11 20:10:34,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 20:10:34,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:34,645 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] [2024-10-11 20:10:34,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 20:10:34,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 20:10:34,850 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-10-11 20:10:34,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:34,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1767172827, now seen corresponding path program 1 times [2024-10-11 20:10:34,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:34,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440003588] [2024-10-11 20:10:34,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:34,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:10:35,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:35,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440003588] [2024-10-11 20:10:35,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440003588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:10:35,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924427920] [2024-10-11 20:10:35,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:35,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:35,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:35,166 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:10:35,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:10:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:35,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:10:35,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 20:10:35,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:10:35,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924427920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:35,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:10:35,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 12 [2024-10-11 20:10:35,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634815447] [2024-10-11 20:10:35,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:35,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:10:35,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:35,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:10:35,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:10:35,356 INFO L87 Difference]: Start difference. First operand 1105 states and 1359 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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-10-11 20:10:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:35,440 INFO L93 Difference]: Finished difference Result 1924 states and 2377 transitions. [2024-10-11 20:10:35,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:10:35,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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 100 [2024-10-11 20:10:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:35,442 INFO L225 Difference]: With dead ends: 1924 [2024-10-11 20:10:35,442 INFO L226 Difference]: Without dead ends: 819 [2024-10-11 20:10:35,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 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-10-11 20:10:35,443 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:35,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 163 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:10:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-10-11 20:10:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 694. [2024-10-11 20:10:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.2294372294372293) internal successors, (852), 693 states have internal predecessors, (852), 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-10-11 20:10:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 852 transitions. [2024-10-11 20:10:35,470 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 852 transitions. Word has length 100 [2024-10-11 20:10:35,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:35,470 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 852 transitions. [2024-10-11 20:10:35,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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-10-11 20:10:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 852 transitions. [2024-10-11 20:10:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 20:10:35,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:35,471 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] [2024-10-11 20:10:35,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 20:10:35,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 20:10:35,676 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-10-11 20:10:35,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:35,676 INFO L85 PathProgramCache]: Analyzing trace with hash 945640225, now seen corresponding path program 1 times [2024-10-11 20:10:35,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:35,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987936311] [2024-10-11 20:10:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:10:35,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 20:10:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:10:35,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 20:10:35,790 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 20:10:35,791 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2024-10-11 20:10:35,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2024-10-11 20:10:35,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2024-10-11 20:10:35,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2024-10-11 20:10:35,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2024-10-11 20:10:35,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2024-10-11 20:10:35,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2024-10-11 20:10:35,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2024-10-11 20:10:35,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2024-10-11 20:10:35,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2024-10-11 20:10:35,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2024-10-11 20:10:35,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2024-10-11 20:10:35,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2024-10-11 20:10:35,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2024-10-11 20:10:35,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2024-10-11 20:10:35,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2024-10-11 20:10:35,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2024-10-11 20:10:35,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2024-10-11 20:10:35,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2024-10-11 20:10:35,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2024-10-11 20:10:35,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2024-10-11 20:10:35,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2024-10-11 20:10:35,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2024-10-11 20:10:35,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2024-10-11 20:10:35,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2024-10-11 20:10:35,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2024-10-11 20:10:35,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2024-10-11 20:10:35,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2024-10-11 20:10:35,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2024-10-11 20:10:35,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2024-10-11 20:10:35,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2024-10-11 20:10:35,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2024-10-11 20:10:35,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2024-10-11 20:10:35,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2024-10-11 20:10:35,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2024-10-11 20:10:35,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2024-10-11 20:10:35,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2024-10-11 20:10:35,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2024-10-11 20:10:35,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2024-10-11 20:10:35,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2024-10-11 20:10:35,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2024-10-11 20:10:35,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 20:10:35,800 INFO L407 BasicCegarLoop]: Path program histogram: [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-10-11 20:10:35,864 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:10:35,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:10:35 BoogieIcfgContainer [2024-10-11 20:10:35,867 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:10:35,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:10:35,868 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:10:35,868 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:10:35,868 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:13" (3/4) ... [2024-10-11 20:10:35,869 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 20:10:35,930 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:10:35,930 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:10:35,930 INFO L158 Benchmark]: Toolchain (without parser) took 23108.94ms. Allocated memory was 176.2MB in the beginning and 524.3MB in the end (delta: 348.1MB). Free memory was 105.2MB in the beginning and 260.3MB in the end (delta: -155.1MB). Peak memory consumption was 193.8MB. Max. memory is 16.1GB. [2024-10-11 20:10:35,930 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 176.2MB. Free memory was 131.5MB in the beginning and 131.4MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:10:35,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.78ms. Allocated memory is still 176.2MB. Free memory was 104.9MB in the beginning and 90.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 20:10:35,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.67ms. Allocated memory is still 176.2MB. Free memory was 90.3MB in the beginning and 144.2MB in the end (delta: -53.9MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-10-11 20:10:35,931 INFO L158 Benchmark]: Boogie Preprocessor took 71.16ms. Allocated memory is still 176.2MB. Free memory was 144.2MB in the beginning and 140.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:10:35,931 INFO L158 Benchmark]: RCFGBuilder took 564.71ms. Allocated memory is still 176.2MB. Free memory was 140.7MB in the beginning and 110.0MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 20:10:35,931 INFO L158 Benchmark]: TraceAbstraction took 21934.93ms. Allocated memory was 176.2MB in the beginning and 524.3MB in the end (delta: 348.1MB). Free memory was 109.2MB in the beginning and 268.7MB in the end (delta: -159.5MB). Peak memory consumption was 187.2MB. Max. memory is 16.1GB. [2024-10-11 20:10:35,931 INFO L158 Benchmark]: Witness Printer took 62.13ms. Allocated memory is still 524.3MB. Free memory was 268.7MB in the beginning and 260.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 20:10:35,932 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.86ms. Allocated memory is still 176.2MB. Free memory was 131.5MB in the beginning and 131.4MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.78ms. Allocated memory is still 176.2MB. Free memory was 104.9MB in the beginning and 90.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.67ms. Allocated memory is still 176.2MB. Free memory was 90.3MB in the beginning and 144.2MB in the end (delta: -53.9MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.16ms. Allocated memory is still 176.2MB. Free memory was 144.2MB in the beginning and 140.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 564.71ms. Allocated memory is still 176.2MB. Free memory was 140.7MB in the beginning and 110.0MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21934.93ms. Allocated memory was 176.2MB in the beginning and 524.3MB in the end (delta: 348.1MB). Free memory was 109.2MB in the beginning and 268.7MB in the end (delta: -159.5MB). Peak memory consumption was 187.2MB. Max. memory is 16.1GB. * Witness Printer took 62.13ms. Allocated memory is still 524.3MB. Free memory was 268.7MB in the beginning and 260.3MB 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=-251548005, 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=-251548005, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L68] nb = (unsigned char)4 VAL [a0=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, 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=-251548005, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, r2=0, r3=255] [L116] EXPR r2 << 16U VAL [a0=-251548005, 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=-251548005, a1=15794606, a2=61697, a3=241, b0=234770789, b1=917073, b2=3582, b3=13, r3=255] [L116] r3 << 24U VAL [a0=-251548005, 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, 127 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 21.8s, OverallIterations: 28, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6199 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6199 mSDsluCounter, 11676 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8479 mSDsCounter, 499 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10780 IncrementalHoareTripleChecker+Invalid, 11279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 499 mSolverCounterUnsat, 3197 mSDtfsCounter, 10780 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1627 GetRequests, 1261 SyntacticMatches, 7 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10134 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2994occurred in iteration=22, InterpolantAutomatonStates: 354, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 23616 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2727 NumberOfCodeBlocks, 2727 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2907 ConstructedInterpolants, 0 QuantifiedInterpolants, 10617 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1879 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 42 InterpolantComputations, 23 PerfectInterpolantSequences, 2149/2514 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-10-11 20:10:35,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)