./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash eae29037f39f72e492ffc0d4d80667eddad5a4a3f1ba42f69f0f22dd69021a00 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:08:14,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:08:14,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 10:08:14,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:08:14,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:08:14,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:08:14,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:08:14,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:08:14,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:08:14,465 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:08:14,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:08:14,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:08:14,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:08:14,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:08:14,467 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:08:14,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:08:14,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:08:14,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:08:14,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:08:14,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:08:14,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:08:14,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:08:14,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:08:14,470 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:08:14,470 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:08:14,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:08:14,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:08:14,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:08:14,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:08:14,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:08:14,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:08:14,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:08:14,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:08:14,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:08:14,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:08:14,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:08:14,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:08:14,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:08:14,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:08:14,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:08:14,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:08:14,477 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eae29037f39f72e492ffc0d4d80667eddad5a4a3f1ba42f69f0f22dd69021a00 [2024-11-19 10:08:14,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:08:14,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:08:14,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:08:14,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:08:14,664 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:08:14,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c [2024-11-19 10:08:16,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:08:16,228 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:08:16,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c [2024-11-19 10:08:16,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63013a714/826007cd5235483c85bf90b47bc9c970/FLAG7fe0371e7 [2024-11-19 10:08:16,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63013a714/826007cd5235483c85bf90b47bc9c970 [2024-11-19 10:08:16,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:08:16,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:08:16,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:08:16,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:08:16,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:08:16,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e841900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16, skipping insertion in model container [2024-11-19 10:08:16,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:08:16,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:08:16,817 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:08:16,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:08:16,874 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:08:16,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16 WrapperNode [2024-11-19 10:08:16,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:08:16,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:08:16,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:08:16,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:08:16,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,937 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 88 [2024-11-19 10:08:16,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:08:16,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:08:16,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:08:16,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:08:16,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,954 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 10:08:16,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:08:16,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:08:16,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:08:16,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:08:16,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16" (1/1) ... [2024-11-19 10:08:16,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:08:16,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:08:16,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 10:08:17,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 10:08:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:08:17,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:08:17,088 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:08:17,089 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:08:17,293 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-19 10:08:17,294 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:08:17,309 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:08:17,310 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 10:08:17,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:08:17 BoogieIcfgContainer [2024-11-19 10:08:17,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:08:17,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:08:17,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:08:17,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:08:17,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:08:16" (1/3) ... [2024-11-19 10:08:17,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc16e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:08:17, skipping insertion in model container [2024-11-19 10:08:17,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:16" (2/3) ... [2024-11-19 10:08:17,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc16e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:08:17, skipping insertion in model container [2024-11-19 10:08:17,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:08:17" (3/3) ... [2024-11-19 10:08:17,318 INFO L112 eAbstractionObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-1.c [2024-11-19 10:08:17,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:08:17,331 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-11-19 10:08:17,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:08:17,391 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;@38b90b6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:08:17,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-11-19 10:08:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 10:08:17,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:17,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 10:08:17,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:17,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:17,412 INFO L85 PathProgramCache]: Analyzing trace with hash 28694083, now seen corresponding path program 1 times [2024-11-19 10:08:17,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:17,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628263686] [2024-11-19 10:08:17,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:17,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628263686] [2024-11-19 10:08:17,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628263686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:17,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:17,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:08:17,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302628169] [2024-11-19 10:08:17,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:17,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:08:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:17,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:08:17,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:08:17,550 INFO L87 Difference]: Start difference. First operand has 88 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:17,738 INFO L93 Difference]: Finished difference Result 176 states and 215 transitions. [2024-11-19 10:08:17,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:08:17,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 10:08:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:17,746 INFO L225 Difference]: With dead ends: 176 [2024-11-19 10:08:17,747 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 10:08:17,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:08:17,751 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:17,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 54 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:08:17,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 10:08:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2024-11-19 10:08:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 83 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-11-19 10:08:17,793 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 5 [2024-11-19 10:08:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:17,793 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-11-19 10:08:17,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-11-19 10:08:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 10:08:17,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:17,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 10:08:17,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:08:17,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:17,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:17,799 INFO L85 PathProgramCache]: Analyzing trace with hash 28696005, now seen corresponding path program 1 times [2024-11-19 10:08:17,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:17,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134213118] [2024-11-19 10:08:17,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:17,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:17,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:17,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134213118] [2024-11-19 10:08:17,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134213118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:17,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:17,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:08:17,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705952569] [2024-11-19 10:08:17,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:17,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:08:17,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:17,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:08:17,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:08:17,840 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:17,988 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2024-11-19 10:08:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:08:17,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 10:08:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:17,993 INFO L225 Difference]: With dead ends: 89 [2024-11-19 10:08:17,993 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 10:08:17,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:08:17,994 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:17,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 42 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 10:08:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2024-11-19 10:08:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 82 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2024-11-19 10:08:18,007 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 5 [2024-11-19 10:08:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:18,007 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2024-11-19 10:08:18,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2024-11-19 10:08:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 10:08:18,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:18,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 10:08:18,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:08:18,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:18,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:18,010 INFO L85 PathProgramCache]: Analyzing trace with hash 889510666, now seen corresponding path program 1 times [2024-11-19 10:08:18,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:18,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742288438] [2024-11-19 10:08:18,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:18,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:18,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742288438] [2024-11-19 10:08:18,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742288438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:18,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:18,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:08:18,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115105716] [2024-11-19 10:08:18,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:18,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:08:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:18,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:08:18,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:08:18,059 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:18,210 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2024-11-19 10:08:18,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:08:18,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-19 10:08:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:18,211 INFO L225 Difference]: With dead ends: 109 [2024-11-19 10:08:18,211 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 10:08:18,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:08:18,213 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 35 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:18,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 44 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 10:08:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2024-11-19 10:08:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 87 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-11-19 10:08:18,223 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 6 [2024-11-19 10:08:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:18,223 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-11-19 10:08:18,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-11-19 10:08:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:08:18,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:18,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:18,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:08:18,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:18,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:18,228 INFO L85 PathProgramCache]: Analyzing trace with hash 184244016, now seen corresponding path program 1 times [2024-11-19 10:08:18,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:18,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947931411] [2024-11-19 10:08:18,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:18,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:18,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:18,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947931411] [2024-11-19 10:08:18,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947931411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:18,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:18,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:08:18,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986566763] [2024-11-19 10:08:18,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:18,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:08:18,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:18,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:08:18,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:08:18,282 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:18,422 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-11-19 10:08:18,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:08:18,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-19 10:08:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:18,424 INFO L225 Difference]: With dead ends: 93 [2024-11-19 10:08:18,424 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 10:08:18,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:08:18,425 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 44 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:18,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 31 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:18,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 10:08:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2024-11-19 10:08:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 86 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-19 10:08:18,431 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 8 [2024-11-19 10:08:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:18,432 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-19 10:08:18,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-19 10:08:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:08:18,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:18,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:18,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:08:18,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:18,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash -535910833, now seen corresponding path program 1 times [2024-11-19 10:08:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:18,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627023418] [2024-11-19 10:08:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:18,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:18,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627023418] [2024-11-19 10:08:18,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627023418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:18,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:18,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:08:18,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916301217] [2024-11-19 10:08:18,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:18,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:08:18,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:18,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:08:18,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:08:18,462 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:18,578 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2024-11-19 10:08:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:08:18,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 10:08:18,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:18,579 INFO L225 Difference]: With dead ends: 121 [2024-11-19 10:08:18,580 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 10:08:18,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:08:18,581 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 75 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:18,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 41 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 10:08:18,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2024-11-19 10:08:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 101 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-11-19 10:08:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2024-11-19 10:08:18,585 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 9 [2024-11-19 10:08:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:18,586 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2024-11-19 10:08:18,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,586 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2024-11-19 10:08:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 10:08:18,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:18,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:18,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:08:18,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:18,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:18,587 INFO L85 PathProgramCache]: Analyzing trace with hash -154658765, now seen corresponding path program 1 times [2024-11-19 10:08:18,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:18,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333280896] [2024-11-19 10:08:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:18,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:18,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:18,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333280896] [2024-11-19 10:08:18,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333280896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:18,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:18,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:08:18,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003027390] [2024-11-19 10:08:18,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:18,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:08:18,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:18,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:08:18,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:08:18,629 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:18,738 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2024-11-19 10:08:18,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:08:18,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-19 10:08:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:18,763 INFO L225 Difference]: With dead ends: 107 [2024-11-19 10:08:18,763 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 10:08:18,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:08:18,764 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:18,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 29 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 10:08:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2024-11-19 10:08:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-19 10:08:18,768 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 11 [2024-11-19 10:08:18,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:18,768 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-19 10:08:18,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,769 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-19 10:08:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 10:08:18,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:18,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:18,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:08:18,770 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:18,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:18,770 INFO L85 PathProgramCache]: Analyzing trace with hash -926118088, now seen corresponding path program 1 times [2024-11-19 10:08:18,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:18,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508995982] [2024-11-19 10:08:18,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:18,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:18,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:18,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508995982] [2024-11-19 10:08:18,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508995982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:18,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:18,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:08:18,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763673220] [2024-11-19 10:08:18,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:18,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:08:18,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:18,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:08:18,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:08:18,806 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:18,938 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2024-11-19 10:08:18,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:08:18,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-11-19 10:08:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:18,940 INFO L225 Difference]: With dead ends: 138 [2024-11-19 10:08:18,940 INFO L226 Difference]: Without dead ends: 132 [2024-11-19 10:08:18,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:08:18,941 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 116 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:18,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 38 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-19 10:08:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 110. [2024-11-19 10:08:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 109 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2024-11-19 10:08:18,946 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 12 [2024-11-19 10:08:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:18,946 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2024-11-19 10:08:18,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2024-11-19 10:08:18,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:08:18,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:18,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:18,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:08:18,947 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:18,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:18,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1060719262, now seen corresponding path program 1 times [2024-11-19 10:08:18,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:18,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054747358] [2024-11-19 10:08:18,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:18,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:19,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:19,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054747358] [2024-11-19 10:08:19,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054747358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:19,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:19,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:08:19,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082777144] [2024-11-19 10:08:19,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:19,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:08:19,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:19,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:08:19,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:08:19,007 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:19,145 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2024-11-19 10:08:19,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:08:19,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 10:08:19,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:19,146 INFO L225 Difference]: With dead ends: 115 [2024-11-19 10:08:19,146 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 10:08:19,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:08:19,147 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:19,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 27 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 10:08:19,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2024-11-19 10:08:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 108 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2024-11-19 10:08:19,150 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 14 [2024-11-19 10:08:19,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:19,151 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2024-11-19 10:08:19,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2024-11-19 10:08:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:08:19,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:19,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:19,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:08:19,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:19,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:19,152 INFO L85 PathProgramCache]: Analyzing trace with hash 886032381, now seen corresponding path program 1 times [2024-11-19 10:08:19,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:19,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872537952] [2024-11-19 10:08:19,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:19,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:19,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:19,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872537952] [2024-11-19 10:08:19,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872537952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:19,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:19,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:08:19,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124410787] [2024-11-19 10:08:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:19,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:08:19,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:19,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:08:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:08:19,206 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:19,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:19,370 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2024-11-19 10:08:19,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:08:19,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 10:08:19,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:19,371 INFO L225 Difference]: With dead ends: 152 [2024-11-19 10:08:19,371 INFO L226 Difference]: Without dead ends: 147 [2024-11-19 10:08:19,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:08:19,372 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 85 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:19,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 41 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:08:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-19 10:08:19,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 112. [2024-11-19 10:08:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 100 states have (on average 1.21) internal successors, (121), 111 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2024-11-19 10:08:19,375 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 15 [2024-11-19 10:08:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:19,375 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-19 10:08:19,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2024-11-19 10:08:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 10:08:19,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:19,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:19,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 10:08:19,376 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:19,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1813230241, now seen corresponding path program 1 times [2024-11-19 10:08:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:19,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757551106] [2024-11-19 10:08:19,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:19,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:19,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757551106] [2024-11-19 10:08:19,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757551106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:19,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:19,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:08:19,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049507914] [2024-11-19 10:08:19,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:19,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:08:19,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:19,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:08:19,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:08:19,455 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:19,551 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2024-11-19 10:08:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:08:19,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-19 10:08:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:19,553 INFO L225 Difference]: With dead ends: 117 [2024-11-19 10:08:19,553 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 10:08:19,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:08:19,554 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 69 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:19,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 19 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 10:08:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2024-11-19 10:08:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 100 states have (on average 1.2) internal successors, (120), 110 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2024-11-19 10:08:19,558 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 17 [2024-11-19 10:08:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:19,558 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-19 10:08:19,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2024-11-19 10:08:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 10:08:19,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:19,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:19,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:08:19,560 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:19,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1078242458, now seen corresponding path program 1 times [2024-11-19 10:08:19,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:19,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670643553] [2024-11-19 10:08:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:19,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:19,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:19,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670643553] [2024-11-19 10:08:19,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670643553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:19,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:19,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:08:19,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625563759] [2024-11-19 10:08:19,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:19,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:08:19,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:19,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:08:19,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:08:19,654 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 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-11-19 10:08:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:19,879 INFO L93 Difference]: Finished difference Result 163 states and 192 transitions. [2024-11-19 10:08:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:08:19,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 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-11-19 10:08:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:19,880 INFO L225 Difference]: With dead ends: 163 [2024-11-19 10:08:19,881 INFO L226 Difference]: Without dead ends: 159 [2024-11-19 10:08:19,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:08:19,881 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 130 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:19,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 37 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:08:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-19 10:08:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 108. [2024-11-19 10:08:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 107 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2024-11-19 10:08:19,887 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 18 [2024-11-19 10:08:19,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:19,887 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2024-11-19 10:08:19,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 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-11-19 10:08:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2024-11-19 10:08:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 10:08:19,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:19,887 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] [2024-11-19 10:08:19,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 10:08:19,888 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:19,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:19,888 INFO L85 PathProgramCache]: Analyzing trace with hash 138534412, now seen corresponding path program 1 times [2024-11-19 10:08:19,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:19,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800252632] [2024-11-19 10:08:19,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:19,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:19,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:19,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800252632] [2024-11-19 10:08:19,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800252632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:19,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:19,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:08:19,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721617125] [2024-11-19 10:08:19,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:19,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 10:08:19,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:19,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 10:08:19,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:08:19,962 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:20,066 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2024-11-19 10:08:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:08:20,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-19 10:08:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:20,069 INFO L225 Difference]: With dead ends: 113 [2024-11-19 10:08:20,069 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 10:08:20,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:08:20,070 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:20,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 19 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 10:08:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2024-11-19 10:08:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 98 states have (on average 1.183673469387755) internal successors, (116), 106 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2024-11-19 10:08:20,077 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 20 [2024-11-19 10:08:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:20,077 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2024-11-19 10:08:20,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2024-11-19 10:08:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 10:08:20,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:20,078 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] [2024-11-19 10:08:20,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 10:08:20,078 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:20,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:20,078 INFO L85 PathProgramCache]: Analyzing trace with hash 139450795, now seen corresponding path program 1 times [2024-11-19 10:08:20,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:20,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884937420] [2024-11-19 10:08:20,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:20,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:20,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884937420] [2024-11-19 10:08:20,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884937420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:20,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:20,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:08:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028239738] [2024-11-19 10:08:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:20,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 10:08:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 10:08:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:08:20,151 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:20,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:20,358 INFO L93 Difference]: Finished difference Result 171 states and 204 transitions. [2024-11-19 10:08:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:08:20,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-11-19 10:08:20,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:20,359 INFO L225 Difference]: With dead ends: 171 [2024-11-19 10:08:20,359 INFO L226 Difference]: Without dead ends: 168 [2024-11-19 10:08:20,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:08:20,360 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 149 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:20,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 38 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:08:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-19 10:08:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 98. [2024-11-19 10:08:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-11-19 10:08:20,365 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 21 [2024-11-19 10:08:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:20,365 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-11-19 10:08:20,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-11-19 10:08:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 10:08:20,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:20,366 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] [2024-11-19 10:08:20,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 10:08:20,366 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:20,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:20,367 INFO L85 PathProgramCache]: Analyzing trace with hash -384783089, now seen corresponding path program 1 times [2024-11-19 10:08:20,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:20,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788000056] [2024-11-19 10:08:20,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:20,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:20,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:20,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788000056] [2024-11-19 10:08:20,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788000056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:20,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:20,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 10:08:20,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950624624] [2024-11-19 10:08:20,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:20,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 10:08:20,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:20,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 10:08:20,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:08:20,469 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:20,616 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-11-19 10:08:20,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 10:08:20,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-19 10:08:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:20,621 INFO L225 Difference]: With dead ends: 103 [2024-11-19 10:08:20,621 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 10:08:20,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:08:20,622 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:20,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 15 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 10:08:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2024-11-19 10:08:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.1777777777777778) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2024-11-19 10:08:20,629 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 23 [2024-11-19 10:08:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:20,629 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2024-11-19 10:08:20,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2024-11-19 10:08:20,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:08:20,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:20,630 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] [2024-11-19 10:08:20,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 10:08:20,630 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:20,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1145382804, now seen corresponding path program 1 times [2024-11-19 10:08:20,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:20,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907122597] [2024-11-19 10:08:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:20,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:20,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:20,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907122597] [2024-11-19 10:08:20,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907122597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:20,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:20,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 10:08:20,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627635890] [2024-11-19 10:08:20,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:20,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 10:08:20,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:20,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 10:08:20,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:08:20,755 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:21,109 INFO L93 Difference]: Finished difference Result 176 states and 213 transitions. [2024-11-19 10:08:21,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 10:08:21,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-19 10:08:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:21,111 INFO L225 Difference]: With dead ends: 176 [2024-11-19 10:08:21,111 INFO L226 Difference]: Without dead ends: 174 [2024-11-19 10:08:21,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:08:21,112 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 112 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:21,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 40 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:08:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-19 10:08:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 82. [2024-11-19 10:08:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 81 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2024-11-19 10:08:21,126 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 24 [2024-11-19 10:08:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:21,127 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2024-11-19 10:08:21,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2024-11-19 10:08:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 10:08:21,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:21,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:21,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 10:08:21,128 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:21,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:21,129 INFO L85 PathProgramCache]: Analyzing trace with hash 194843002, now seen corresponding path program 1 times [2024-11-19 10:08:21,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:21,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724234872] [2024-11-19 10:08:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:21,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:21,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:21,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724234872] [2024-11-19 10:08:21,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724234872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:21,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:21,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 10:08:21,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52172282] [2024-11-19 10:08:21,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:21,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:08:21,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:21,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:08:21,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:08:21,268 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:21,358 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-11-19 10:08:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:08:21,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-19 10:08:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:21,358 INFO L225 Difference]: With dead ends: 87 [2024-11-19 10:08:21,359 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 10:08:21,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:08:21,359 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:21,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 9 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 10:08:21,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2024-11-19 10:08:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-11-19 10:08:21,364 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 26 [2024-11-19 10:08:21,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:21,364 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-11-19 10:08:21,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-11-19 10:08:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 10:08:21,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:21,365 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] [2024-11-19 10:08:21,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 10:08:21,365 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:21,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:21,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1415914663, now seen corresponding path program 1 times [2024-11-19 10:08:21,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:21,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060304402] [2024-11-19 10:08:21,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:21,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:21,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:21,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060304402] [2024-11-19 10:08:21,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060304402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:21,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:21,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 10:08:21,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510176042] [2024-11-19 10:08:21,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:21,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:08:21,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:21,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:08:21,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:08:21,505 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-11-19 10:08:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:21,870 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2024-11-19 10:08:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:08:21,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 27 [2024-11-19 10:08:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:21,871 INFO L225 Difference]: With dead ends: 178 [2024-11-19 10:08:21,874 INFO L226 Difference]: Without dead ends: 177 [2024-11-19 10:08:21,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:08:21,875 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 161 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:21,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 48 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:08:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-19 10:08:21,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 60. [2024-11-19 10:08:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2024-11-19 10:08:21,877 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 27 [2024-11-19 10:08:21,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:21,877 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2024-11-19 10:08:21,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-11-19 10:08:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-11-19 10:08:21,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 10:08:21,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:21,881 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] [2024-11-19 10:08:21,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 10:08:21,882 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:21,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash 810646747, now seen corresponding path program 1 times [2024-11-19 10:08:21,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:21,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113585041] [2024-11-19 10:08:21,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:21,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:21,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:21,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113585041] [2024-11-19 10:08:21,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113585041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:21,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:21,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:08:21,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448340884] [2024-11-19 10:08:21,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:21,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:08:21,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:21,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:08:21,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:08:21,977 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:22,127 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2024-11-19 10:08:22,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:08:22,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-19 10:08:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:22,128 INFO L225 Difference]: With dead ends: 85 [2024-11-19 10:08:22,128 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 10:08:22,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:08:22,128 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:22,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 39 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 10:08:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2024-11-19 10:08:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 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-11-19 10:08:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2024-11-19 10:08:22,133 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 29 [2024-11-19 10:08:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:22,133 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-11-19 10:08:22,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:08:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2024-11-19 10:08:22,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 10:08:22,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:22,135 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] [2024-11-19 10:08:22,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 10:08:22,135 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-19 10:08:22,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:22,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2067203933, now seen corresponding path program 1 times [2024-11-19 10:08:22,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:22,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576785997] [2024-11-19 10:08:22,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:22,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:08:22,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 10:08:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:08:22,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 10:08:22,185 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 10:08:22,186 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 36 remaining) [2024-11-19 10:08:22,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 36 remaining) [2024-11-19 10:08:22,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 36 remaining) [2024-11-19 10:08:22,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 36 remaining) [2024-11-19 10:08:22,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 36 remaining) [2024-11-19 10:08:22,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 36 remaining) [2024-11-19 10:08:22,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 36 remaining) [2024-11-19 10:08:22,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 36 remaining) [2024-11-19 10:08:22,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 36 remaining) [2024-11-19 10:08:22,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 36 remaining) [2024-11-19 10:08:22,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 36 remaining) [2024-11-19 10:08:22,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 36 remaining) [2024-11-19 10:08:22,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 36 remaining) [2024-11-19 10:08:22,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 36 remaining) [2024-11-19 10:08:22,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 36 remaining) [2024-11-19 10:08:22,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 36 remaining) [2024-11-19 10:08:22,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 36 remaining) [2024-11-19 10:08:22,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 36 remaining) [2024-11-19 10:08:22,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 36 remaining) [2024-11-19 10:08:22,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 36 remaining) [2024-11-19 10:08:22,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 36 remaining) [2024-11-19 10:08:22,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 10:08:22,201 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:22,233 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:08:22,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:08:22 BoogieIcfgContainer [2024-11-19 10:08:22,242 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:08:22,243 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:08:22,243 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:08:22,243 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:08:22,243 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:08:17" (3/4) ... [2024-11-19 10:08:22,245 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 10:08:22,309 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:08:22,309 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:08:22,310 INFO L158 Benchmark]: Toolchain (without parser) took 5681.75ms. Allocated memory was 190.8MB in the beginning and 278.9MB in the end (delta: 88.1MB). Free memory was 124.3MB in the beginning and 224.0MB in the end (delta: -99.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:08:22,310 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 190.8MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:08:22,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.83ms. Allocated memory is still 190.8MB. Free memory was 124.1MB in the beginning and 162.5MB in the end (delta: -38.5MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-19 10:08:22,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.56ms. Allocated memory is still 190.8MB. Free memory was 162.5MB in the beginning and 160.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:08:22,311 INFO L158 Benchmark]: Boogie Preprocessor took 24.11ms. Allocated memory is still 190.8MB. Free memory was 160.4MB in the beginning and 159.4MB in the end (delta: 985.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:08:22,312 INFO L158 Benchmark]: RCFGBuilder took 347.60ms. Allocated memory is still 190.8MB. Free memory was 159.4MB in the beginning and 143.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 10:08:22,313 INFO L158 Benchmark]: TraceAbstraction took 4929.74ms. Allocated memory was 190.8MB in the beginning and 278.9MB in the end (delta: 88.1MB). Free memory was 142.7MB in the beginning and 227.2MB in the end (delta: -84.4MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-19 10:08:22,313 INFO L158 Benchmark]: Witness Printer took 66.44ms. Allocated memory is still 278.9MB. Free memory was 226.1MB in the beginning and 224.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:08:22,319 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.18ms. Allocated memory is still 190.8MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.83ms. Allocated memory is still 190.8MB. Free memory was 124.1MB in the beginning and 162.5MB in the end (delta: -38.5MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.56ms. Allocated memory is still 190.8MB. Free memory was 162.5MB in the beginning and 160.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.11ms. Allocated memory is still 190.8MB. Free memory was 160.4MB in the beginning and 159.4MB in the end (delta: 985.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 347.60ms. Allocated memory is still 190.8MB. Free memory was 159.4MB in the beginning and 143.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4929.74ms. Allocated memory was 190.8MB in the beginning and 278.9MB in the end (delta: 88.1MB). Free memory was 142.7MB in the beginning and 227.2MB in the end (delta: -84.4MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Witness Printer took 66.44ms. Allocated memory is still 278.9MB. Free memory was 226.1MB in the beginning and 224.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 65]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x; [L15] int y; [L16] int z; [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L19] COND FALSE !(__VERIFIER_nondet_int() != 0) [L22] x = -1 VAL [x=-1, y=-2147483648, z=0] [L24] COND FALSE !(x > 0) VAL [x=-1, y=-2147483648, z=0] [L27] EXPR x - 1 [L27] x = x - 1 VAL [x=-2, y=-2147483648, z=0] [L29] COND FALSE !(x > 0) VAL [x=-2, y=-2147483648, z=0] [L32] EXPR x - 1 [L32] x = x - 1 VAL [x=-3, y=-2147483648, z=0] [L34] COND FALSE !(x > 0) VAL [x=-3, y=-2147483648, z=0] [L37] EXPR x - 1 [L37] x = x - 1 VAL [x=-4, y=-2147483648, z=0] [L39] COND FALSE !(x > 0) VAL [x=-4, y=-2147483648, z=0] [L42] EXPR x - 1 [L42] x = x - 1 VAL [x=-5, y=-2147483648, z=0] [L44] COND FALSE !(x > 0) VAL [x=-5, y=-2147483648, z=0] [L47] EXPR x - 1 [L47] x = x - 1 VAL [x=-6, y=-2147483648, z=0] [L49] COND FALSE !(x > 0) VAL [x=-6, y=-2147483648, z=0] [L52] EXPR x - 1 [L52] x = x - 1 VAL [x=-7, y=-2147483648, z=0] [L54] COND FALSE !(x > 0) VAL [x=-7, y=-2147483648, z=0] [L57] EXPR x - 1 [L57] x = x - 1 VAL [x=-8, y=-2147483648, z=0] [L59] COND FALSE !(x > 0) VAL [x=-8, y=-2147483648, z=0] [L62] EXPR x - 1 [L62] x = x - 1 VAL [x=-9, y=-2147483648, z=0] [L64] COND TRUE y<100 && z<100 VAL [x=-9, y=-2147483648, z=0] [L65] y+x VAL [z=0] - UnprovableResult [Line: 25]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: 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: 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: 65]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: 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, 88 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1309 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1309 mSDsluCounter, 611 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 626 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3825 IncrementalHoareTripleChecker+Invalid, 4451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 626 mSolverCounterUnsat, 479 mSDtfsCounter, 3825 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=9, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 471 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 1002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 10:08:22,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)