./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1870b8451d4735c7264ac4337bbb2c1eeecb277125949d2d6e57edbf68a24fac --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 12:10:02,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 12:10:03,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 12:10:03,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 12:10:03,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 12:10:03,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 12:10:03,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 12:10:03,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 12:10:03,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 12:10:03,083 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 12:10:03,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 12:10:03,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 12:10:03,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 12:10:03,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 12:10:03,085 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 12:10:03,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 12:10:03,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 12:10:03,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 12:10:03,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 12:10:03,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 12:10:03,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 12:10:03,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 12:10:03,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 12:10:03,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 12:10:03,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 12:10:03,092 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 12:10:03,093 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 12:10:03,093 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 12:10:03,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 12:10:03,093 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 12:10:03,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 12:10:03,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 12:10:03,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 12:10:03,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 12:10:03,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:10:03,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 12:10:03,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 12:10:03,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 12:10:03,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 12:10:03,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 12:10:03,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 12:10:03,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 12:10:03,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 12:10:03,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 12:10:03,097 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1870b8451d4735c7264ac4337bbb2c1eeecb277125949d2d6e57edbf68a24fac [2024-11-09 12:10:03,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 12:10:03,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 12:10:03,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 12:10:03,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 12:10:03,421 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 12:10:03,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2024-11-09 12:10:05,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 12:10:05,557 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 12:10:05,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2024-11-09 12:10:05,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae226ba26/dccb51e97dd54ce9a48a245980779410/FLAGdbbd02f2a [2024-11-09 12:10:05,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae226ba26/dccb51e97dd54ce9a48a245980779410 [2024-11-09 12:10:05,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 12:10:05,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 12:10:05,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 12:10:05,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 12:10:05,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 12:10:05,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:05,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55af932c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05, skipping insertion in model container [2024-11-09 12:10:05,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:05,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 12:10:05,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:10:05,888 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 12:10:05,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:10:05,927 INFO L204 MainTranslator]: Completed translation [2024-11-09 12:10:05,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05 WrapperNode [2024-11-09 12:10:05,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 12:10:05,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 12:10:05,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 12:10:05,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 12:10:05,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:05,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:05,991 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2024-11-09 12:10:05,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 12:10:05,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 12:10:05,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 12:10:05,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 12:10:06,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:06,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:06,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:06,037 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 12:10:06,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:06,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:06,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:06,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:06,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:06,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:06,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 12:10:06,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 12:10:06,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 12:10:06,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 12:10:06,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05" (1/1) ... [2024-11-09 12:10:06,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:10:06,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:06,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 12:10:06,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 12:10:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 12:10:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 12:10:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 12:10:06,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 12:10:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 12:10:06,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 12:10:06,257 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 12:10:06,260 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 12:10:06,600 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-09 12:10:06,600 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 12:10:06,630 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 12:10:06,631 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 12:10:06,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:10:06 BoogieIcfgContainer [2024-11-09 12:10:06,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 12:10:06,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 12:10:06,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 12:10:06,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 12:10:06,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:10:05" (1/3) ... [2024-11-09 12:10:06,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f280a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:10:06, skipping insertion in model container [2024-11-09 12:10:06,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:05" (2/3) ... [2024-11-09 12:10:06,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f280a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:10:06, skipping insertion in model container [2024-11-09 12:10:06,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:10:06" (3/3) ... [2024-11-09 12:10:06,640 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound1.c [2024-11-09 12:10:06,657 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 12:10:06,658 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2024-11-09 12:10:06,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 12:10:06,727 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;@352f71c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 12:10:06,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-11-09 12:10:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 117 states have internal predecessors, (121), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 12:10:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 12:10:06,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:06,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 12:10:06,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:06,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash 928069, now seen corresponding path program 1 times [2024-11-09 12:10:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:06,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678544857] [2024-11-09 12:10:06,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:06,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:10:06,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:06,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678544857] [2024-11-09 12:10:06,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678544857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:06,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:06,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:10:06,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957772358] [2024-11-09 12:10:06,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:06,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 12:10:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:06,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 12:10:06,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 12:10:06,914 INFO L87 Difference]: Start difference. First operand has 125 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 117 states have internal predecessors, (121), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:10:06,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:06,942 INFO L93 Difference]: Finished difference Result 243 states and 269 transitions. [2024-11-09 12:10:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 12:10:06,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 12:10:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:06,951 INFO L225 Difference]: With dead ends: 243 [2024-11-09 12:10:06,952 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 12:10:06,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 12:10:06,958 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:06,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:10:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 12:10:07,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 12:10:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 107 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:10:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2024-11-09 12:10:07,044 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 4 [2024-11-09 12:10:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:07,044 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2024-11-09 12:10:07,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:10:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2024-11-09 12:10:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 12:10:07,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:07,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 12:10:07,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 12:10:07,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:07,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:07,082 INFO L85 PathProgramCache]: Analyzing trace with hash 925668, now seen corresponding path program 1 times [2024-11-09 12:10:07,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:07,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914065304] [2024-11-09 12:10:07,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:07,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:10:07,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:07,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914065304] [2024-11-09 12:10:07,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914065304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:07,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:07,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:10:07,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880961989] [2024-11-09 12:10:07,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:07,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:10:07,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:07,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:10:07,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:10:07,206 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:10:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:07,248 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2024-11-09 12:10:07,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:10:07,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 12:10:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:07,251 INFO L225 Difference]: With dead ends: 114 [2024-11-09 12:10:07,253 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 12:10:07,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:10:07,254 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 117 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:07,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 223 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:10:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 12:10:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 12:10:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 60 states have (on average 1.8) internal successors, (108), 106 states have internal predecessors, (108), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:10:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2024-11-09 12:10:07,274 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 4 [2024-11-09 12:10:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:07,277 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2024-11-09 12:10:07,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:10:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2024-11-09 12:10:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 12:10:07,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:07,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 12:10:07,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 12:10:07,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:07,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:07,280 INFO L85 PathProgramCache]: Analyzing trace with hash 28695749, now seen corresponding path program 1 times [2024-11-09 12:10:07,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:07,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141618412] [2024-11-09 12:10:07,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:07,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:10:07,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:07,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141618412] [2024-11-09 12:10:07,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141618412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:07,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:07,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:10:07,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162532930] [2024-11-09 12:10:07,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:07,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:10:07,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:07,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:10:07,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:10:07,326 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:10:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:07,370 INFO L93 Difference]: Finished difference Result 166 states and 172 transitions. [2024-11-09 12:10:07,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:10:07,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 12:10:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:07,372 INFO L225 Difference]: With dead ends: 166 [2024-11-09 12:10:07,373 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 12:10:07,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:10:07,374 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:07,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 338 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:10:07,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 12:10:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-09 12:10:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 64 states have (on average 1.75) internal successors, (112), 110 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:10:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2024-11-09 12:10:07,384 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 5 [2024-11-09 12:10:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:07,384 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2024-11-09 12:10:07,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:10:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2024-11-09 12:10:07,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 12:10:07,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:07,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:07,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 12:10:07,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:07,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:07,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1806812487, now seen corresponding path program 1 times [2024-11-09 12:10:07,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:07,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660669087] [2024-11-09 12:10:07,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:07,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:10:07,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:07,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660669087] [2024-11-09 12:10:07,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660669087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:07,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:07,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:10:07,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767150785] [2024-11-09 12:10:07,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:07,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:10:07,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:07,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:10:07,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:10:07,445 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:10:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:07,598 INFO L93 Difference]: Finished difference Result 211 states and 221 transitions. [2024-11-09 12:10:07,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:10:07,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-09 12:10:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:07,600 INFO L225 Difference]: With dead ends: 211 [2024-11-09 12:10:07,602 INFO L226 Difference]: Without dead ends: 191 [2024-11-09 12:10:07,603 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-09 12:10:07,604 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 68 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:07,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 171 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:07,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-09 12:10:07,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 156. [2024-11-09 12:10:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 99 states have (on average 1.606060606060606) internal successors, (159), 145 states have internal predecessors, (159), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 12:10:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2024-11-09 12:10:07,629 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 7 [2024-11-09 12:10:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:07,629 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2024-11-09 12:10:07,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:10:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2024-11-09 12:10:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 12:10:07,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:07,631 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:07,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 12:10:07,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:07,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:07,631 INFO L85 PathProgramCache]: Analyzing trace with hash 323965805, now seen corresponding path program 1 times [2024-11-09 12:10:07,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:07,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111499997] [2024-11-09 12:10:07,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:07,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:10:07,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698320727] [2024-11-09 12:10:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:07,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:07,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:07,668 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:07,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 12:10:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:07,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:10:07,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:10:07,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:10:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:07,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111499997] [2024-11-09 12:10:07,762 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:10:07,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698320727] [2024-11-09 12:10:07,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698320727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:07,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:07,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:10:07,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356554555] [2024-11-09 12:10:07,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:07,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:10:07,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:07,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:10:07,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:10:07,765 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:07,839 INFO L93 Difference]: Finished difference Result 183 states and 205 transitions. [2024-11-09 12:10:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:10:07,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-09 12:10:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:07,840 INFO L225 Difference]: With dead ends: 183 [2024-11-09 12:10:07,841 INFO L226 Difference]: Without dead ends: 175 [2024-11-09 12:10:07,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-09 12:10:07,842 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 41 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:07,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 166 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-09 12:10:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2024-11-09 12:10:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 109 states have (on average 1.5596330275229358) internal successors, (170), 155 states have internal predecessors, (170), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 12:10:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 190 transitions. [2024-11-09 12:10:07,850 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 190 transitions. Word has length 28 [2024-11-09 12:10:07,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:07,851 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 190 transitions. [2024-11-09 12:10:07,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2024-11-09 12:10:07,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 12:10:07,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:07,852 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:07,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 12:10:08,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:08,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:08,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:08,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1453005437, now seen corresponding path program 1 times [2024-11-09 12:10:08,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:08,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534106528] [2024-11-09 12:10:08,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:08,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:08,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 12:10:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:08,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 12:10:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:10:08,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:08,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534106528] [2024-11-09 12:10:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534106528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:08,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:08,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:10:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488464288] [2024-11-09 12:10:08,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:08,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:10:08,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:08,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:10:08,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:10:08,157 INFO L87 Difference]: Start difference. First operand 167 states and 190 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:08,235 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2024-11-09 12:10:08,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:10:08,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-09 12:10:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:08,237 INFO L225 Difference]: With dead ends: 183 [2024-11-09 12:10:08,237 INFO L226 Difference]: Without dead ends: 173 [2024-11-09 12:10:08,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-09 12:10:08,238 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 38 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:08,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 195 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:08,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-09 12:10:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2024-11-09 12:10:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 112 states have (on average 1.4821428571428572) internal successors, (166), 158 states have internal predecessors, (166), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 12:10:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2024-11-09 12:10:08,247 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 29 [2024-11-09 12:10:08,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:08,247 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2024-11-09 12:10:08,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2024-11-09 12:10:08,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 12:10:08,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:08,248 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:08,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 12:10:08,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:08,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:08,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1804640113, now seen corresponding path program 1 times [2024-11-09 12:10:08,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:08,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963722553] [2024-11-09 12:10:08,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:08,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:08,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 12:10:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:08,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 12:10:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:10:08,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:08,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963722553] [2024-11-09 12:10:08,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963722553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:08,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:08,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:10:08,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856094969] [2024-11-09 12:10:08,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:08,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:10:08,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:08,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:10:08,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:10:08,380 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:08,517 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2024-11-09 12:10:08,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:10:08,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-09 12:10:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:08,522 INFO L225 Difference]: With dead ends: 175 [2024-11-09 12:10:08,522 INFO L226 Difference]: Without dead ends: 173 [2024-11-09 12:10:08,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-09 12:10:08,523 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 83 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:08,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 186 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-09 12:10:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2024-11-09 12:10:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 112 states have (on average 1.4642857142857142) internal successors, (164), 158 states have internal predecessors, (164), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 12:10:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2024-11-09 12:10:08,541 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 32 [2024-11-09 12:10:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:08,542 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2024-11-09 12:10:08,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2024-11-09 12:10:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 12:10:08,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:08,543 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:08,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 12:10:08,543 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:08,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:08,543 INFO L85 PathProgramCache]: Analyzing trace with hash -360182923, now seen corresponding path program 1 times [2024-11-09 12:10:08,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:08,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204765073] [2024-11-09 12:10:08,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:08,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:08,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 12:10:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:08,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 12:10:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:10:08,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:08,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204765073] [2024-11-09 12:10:08,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204765073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:08,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:08,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:10:08,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165484314] [2024-11-09 12:10:08,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:08,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:10:08,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:08,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:10:08,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:10:08,714 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:08,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:08,854 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2024-11-09 12:10:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:10:08,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-09 12:10:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:08,855 INFO L225 Difference]: With dead ends: 175 [2024-11-09 12:10:08,855 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 12:10:08,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-09 12:10:08,861 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 29 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:08,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 174 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 12:10:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-09 12:10:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 91 states have (on average 1.5274725274725274) internal successors, (139), 137 states have internal predecessors, (139), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 12:10:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2024-11-09 12:10:08,876 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 36 [2024-11-09 12:10:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:08,877 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2024-11-09 12:10:08,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:10:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2024-11-09 12:10:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 12:10:08,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:08,878 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:08,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 12:10:08,878 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:08,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:08,878 INFO L85 PathProgramCache]: Analyzing trace with hash 89880211, now seen corresponding path program 1 times [2024-11-09 12:10:08,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:08,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61932068] [2024-11-09 12:10:08,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:08,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 12:10:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 12:10:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 12:10:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:09,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:09,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61932068] [2024-11-09 12:10:09,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61932068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:09,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:09,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:10:09,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813028475] [2024-11-09 12:10:09,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:09,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:10:09,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:09,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:10:09,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:10:09,068 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:09,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:09,175 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2024-11-09 12:10:09,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:10:09,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-09 12:10:09,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:09,177 INFO L225 Difference]: With dead ends: 150 [2024-11-09 12:10:09,178 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 12:10:09,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:10:09,179 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:09,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 221 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 12:10:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2024-11-09 12:10:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 92 states have (on average 1.5217391304347827) internal successors, (140), 138 states have internal predecessors, (140), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 12:10:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2024-11-09 12:10:09,187 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 49 [2024-11-09 12:10:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:09,189 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2024-11-09 12:10:09,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2024-11-09 12:10:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 12:10:09,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:09,190 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:09,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 12:10:09,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:09,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1508680645, now seen corresponding path program 1 times [2024-11-09 12:10:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993354212] [2024-11-09 12:10:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 12:10:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 12:10:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 12:10:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:09,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:09,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993354212] [2024-11-09 12:10:09,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993354212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:09,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:09,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:10:09,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314773784] [2024-11-09 12:10:09,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:09,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:10:09,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:09,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:10:09,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:10:09,324 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:09,422 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2024-11-09 12:10:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:10:09,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-09 12:10:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:09,424 INFO L225 Difference]: With dead ends: 150 [2024-11-09 12:10:09,425 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 12:10:09,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-09 12:10:09,426 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:09,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 12:10:09,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-09 12:10:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 139 states have internal predecessors, (141), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 12:10:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2024-11-09 12:10:09,434 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 50 [2024-11-09 12:10:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:09,435 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2024-11-09 12:10:09,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2024-11-09 12:10:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 12:10:09,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:09,437 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:09,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 12:10:09,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:09,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:09,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1727694252, now seen corresponding path program 1 times [2024-11-09 12:10:09,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:09,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672100260] [2024-11-09 12:10:09,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:09,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 12:10:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 12:10:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 12:10:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:09,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672100260] [2024-11-09 12:10:09,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672100260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:09,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:10:09,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 12:10:09,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666577223] [2024-11-09 12:10:09,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:09,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:10:09,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:10:09,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:10:09,538 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:09,588 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2024-11-09 12:10:09,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:10:09,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-09 12:10:09,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:09,590 INFO L225 Difference]: With dead ends: 197 [2024-11-09 12:10:09,590 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 12:10:09,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:10:09,591 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 83 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:09,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 506 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:10:09,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 12:10:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 164. [2024-11-09 12:10:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.528301886792453) internal successors, (162), 152 states have internal predecessors, (162), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 12:10:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 182 transitions. [2024-11-09 12:10:09,599 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 182 transitions. Word has length 53 [2024-11-09 12:10:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:09,599 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 182 transitions. [2024-11-09 12:10:09,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 182 transitions. [2024-11-09 12:10:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 12:10:09,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:09,600 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:09,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 12:10:09,601 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:09,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:09,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1838165906, now seen corresponding path program 1 times [2024-11-09 12:10:09,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:09,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510091809] [2024-11-09 12:10:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:09,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 12:10:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 12:10:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 12:10:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:09,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:09,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510091809] [2024-11-09 12:10:09,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510091809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:10:09,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861237863] [2024-11-09 12:10:09,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:09,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:09,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:09,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:09,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 12:10:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:09,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:10:09,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:09,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:10:09,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861237863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:09,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:10:09,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-09 12:10:09,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769315273] [2024-11-09 12:10:09,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:09,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:10:09,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:09,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:10:09,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:10:09,827 INFO L87 Difference]: Start difference. First operand 164 states and 182 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:09,897 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2024-11-09 12:10:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:10:09,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-09 12:10:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:09,899 INFO L225 Difference]: With dead ends: 164 [2024-11-09 12:10:09,899 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 12:10:09,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:10:09,900 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 122 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:09,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 127 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 12:10:09,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-09 12:10:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.4056603773584906) internal successors, (149), 143 states have internal predecessors, (149), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 12:10:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2024-11-09 12:10:09,905 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 55 [2024-11-09 12:10:09,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:09,906 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2024-11-09 12:10:09,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:10:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2024-11-09 12:10:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 12:10:09,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:09,907 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:09,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 12:10:10,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 12:10:10,111 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:10,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:10,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1148568188, now seen corresponding path program 1 times [2024-11-09 12:10:10,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:10,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379367756] [2024-11-09 12:10:10,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:10,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:10,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 12:10:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:10,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 12:10:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:10,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 12:10:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:10,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:10,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379367756] [2024-11-09 12:10:10,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379367756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:10:10,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834193262] [2024-11-09 12:10:10,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:10,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:10,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:10,188 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:10,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 12:10:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:10,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:10:10,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:10,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:10:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:10,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834193262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:10:10,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:10:10,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-09 12:10:10,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649930238] [2024-11-09 12:10:10,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:10:10,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:10:10,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:10,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:10:10,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:10:10,488 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 7 states, 6 states have (on average 19.0) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 12:10:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:10,693 INFO L93 Difference]: Finished difference Result 279 states and 330 transitions. [2024-11-09 12:10:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:10:10,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 19.0) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2024-11-09 12:10:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:10,696 INFO L225 Difference]: With dead ends: 279 [2024-11-09 12:10:10,696 INFO L226 Difference]: Without dead ends: 270 [2024-11-09 12:10:10,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:10:10,697 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 143 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:10,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 231 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:10:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-09 12:10:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 146. [2024-11-09 12:10:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 134 states have internal predecessors, (136), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 12:10:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2024-11-09 12:10:10,705 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 56 [2024-11-09 12:10:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:10,705 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2024-11-09 12:10:10,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 19.0) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 12:10:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2024-11-09 12:10:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 12:10:10,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:10,706 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:10,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 12:10:10,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:10,911 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:10,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:10,912 INFO L85 PathProgramCache]: Analyzing trace with hash -105881028, now seen corresponding path program 1 times [2024-11-09 12:10:10,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:10,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973864990] [2024-11-09 12:10:10,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:10,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 12:10:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:10,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 12:10:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:10,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 12:10:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:10,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 12:10:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:10:11,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:11,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973864990] [2024-11-09 12:10:11,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973864990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:10:11,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084287559] [2024-11-09 12:10:11,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:11,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:11,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:11,004 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:11,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 12:10:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:11,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:10:11,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:10:11,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:10:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:10:11,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084287559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:10:11,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:10:11,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 6 [2024-11-09 12:10:11,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745105802] [2024-11-09 12:10:11,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:10:11,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:10:11,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:11,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:10:11,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:10:11,347 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 12:10:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:11,410 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2024-11-09 12:10:11,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:10:11,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2024-11-09 12:10:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:11,412 INFO L225 Difference]: With dead ends: 194 [2024-11-09 12:10:11,412 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 12:10:11,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:10:11,413 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 77 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:11,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 154 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:10:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 12:10:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 12:10:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.164179104477612) internal successors, (78), 78 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:10:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2024-11-09 12:10:11,418 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 69 [2024-11-09 12:10:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:11,418 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2024-11-09 12:10:11,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 12:10:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2024-11-09 12:10:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 12:10:11,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:11,419 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:11,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 12:10:11,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:11,624 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:11,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2025069290, now seen corresponding path program 1 times [2024-11-09 12:10:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:11,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16720597] [2024-11-09 12:10:11,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:11,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:10:11,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38890160] [2024-11-09 12:10:11,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:11,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:11,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:11,641 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:11,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 12:10:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:11,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:10:11,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:10:11,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:10:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:10:12,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:12,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16720597] [2024-11-09 12:10:12,057 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:10:12,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38890160] [2024-11-09 12:10:12,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38890160] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:10:12,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:10:12,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-09 12:10:12,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452215199] [2024-11-09 12:10:12,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:10:12,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:10:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:12,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:10:12,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:10:12,060 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 12:10:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:12,112 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2024-11-09 12:10:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:10:12,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2024-11-09 12:10:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:12,114 INFO L225 Difference]: With dead ends: 86 [2024-11-09 12:10:12,114 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 12:10:12,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:10:12,115 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:12,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 127 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:10:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 12:10:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 12:10:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 77 states have internal predecessors, (77), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:10:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2024-11-09 12:10:12,119 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 69 [2024-11-09 12:10:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:12,120 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2024-11-09 12:10:12,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 12:10:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2024-11-09 12:10:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 12:10:12,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:12,121 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:12,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 12:10:12,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 12:10:12,325 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:12,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1157947556, now seen corresponding path program 1 times [2024-11-09 12:10:12,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:12,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383344810] [2024-11-09 12:10:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:10:12,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398419622] [2024-11-09 12:10:12,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:12,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:12,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:12,341 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:12,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 12:10:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:12,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:10:12,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:12,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:10:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:12,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:12,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383344810] [2024-11-09 12:10:12,605 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:10:12,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398419622] [2024-11-09 12:10:12,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398419622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:10:12,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:10:12,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-09 12:10:12,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514810090] [2024-11-09 12:10:12,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:10:12,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:10:12,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:12,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:10:12,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:10:12,608 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 12:10:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:12,670 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2024-11-09 12:10:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:10:12,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 76 [2024-11-09 12:10:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:12,671 INFO L225 Difference]: With dead ends: 85 [2024-11-09 12:10:12,671 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 12:10:12,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:10:12,672 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 24 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:12,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 107 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 12:10:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 12:10:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 74 states have internal predecessors, (74), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:10:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2024-11-09 12:10:12,677 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 76 [2024-11-09 12:10:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:12,677 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2024-11-09 12:10:12,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 12:10:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2024-11-09 12:10:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 12:10:12,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:12,678 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:12,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 12:10:12,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 12:10:12,880 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:12,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:12,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1536636009, now seen corresponding path program 1 times [2024-11-09 12:10:12,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:12,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49275920] [2024-11-09 12:10:12,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:12,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:12,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 12:10:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:12,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 12:10:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:12,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 12:10:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:12,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 12:10:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:12,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 12:10:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:12,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:12,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49275920] [2024-11-09 12:10:12,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49275920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:10:12,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252858216] [2024-11-09 12:10:12,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:12,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:12,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:12,974 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:12,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 12:10:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:13,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:10:13,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:13,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:10:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:13,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252858216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:10:13,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:10:13,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 12:10:13,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960190347] [2024-11-09 12:10:13,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:10:13,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 12:10:13,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:13,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 12:10:13,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:10:13,384 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 10 states, 9 states have (on average 15.555555555555555) internal successors, (140), 10 states have internal predecessors, (140), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-09 12:10:13,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:13,518 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2024-11-09 12:10:13,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:10:13,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.555555555555555) internal successors, (140), 10 states have internal predecessors, (140), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 77 [2024-11-09 12:10:13,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:13,519 INFO L225 Difference]: With dead ends: 82 [2024-11-09 12:10:13,519 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 12:10:13,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-09 12:10:13,520 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 56 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:13,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 150 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 12:10:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 12:10:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 73 states have internal predecessors, (73), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:10:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2024-11-09 12:10:13,524 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 77 [2024-11-09 12:10:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:13,525 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2024-11-09 12:10:13,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.555555555555555) internal successors, (140), 10 states have internal predecessors, (140), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-09 12:10:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2024-11-09 12:10:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 12:10:13,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:13,526 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:13,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 12:10:13,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:13,731 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:13,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:13,732 INFO L85 PathProgramCache]: Analyzing trace with hash 391076166, now seen corresponding path program 1 times [2024-11-09 12:10:13,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:13,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283471206] [2024-11-09 12:10:13,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:13,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:13,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 12:10:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:13,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 12:10:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:13,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 12:10:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:13,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 12:10:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:13,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 12:10:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:13,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:13,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283471206] [2024-11-09 12:10:13,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283471206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:10:13,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868915698] [2024-11-09 12:10:13,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:13,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:13,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:13,838 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:13,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 12:10:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:13,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:10:13,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:14,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:10:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:14,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868915698] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:10:14,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:10:14,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 12:10:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435952568] [2024-11-09 12:10:14,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:10:14,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 12:10:14,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:14,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 12:10:14,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:10:14,296 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 10 states, 9 states have (on average 15.777777777777779) internal successors, (142), 10 states have internal predecessors, (142), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-09 12:10:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:14,364 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2024-11-09 12:10:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:10:14,365 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.777777777777779) internal successors, (142), 10 states have internal predecessors, (142), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 78 [2024-11-09 12:10:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:14,366 INFO L225 Difference]: With dead ends: 81 [2024-11-09 12:10:14,366 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 12:10:14,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=60, Unknown=0, NotChecked=0, Total=110 [2024-11-09 12:10:14,366 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:14,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 106 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:10:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 12:10:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 12:10:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 69 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:10:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2024-11-09 12:10:14,370 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 78 [2024-11-09 12:10:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:14,370 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2024-11-09 12:10:14,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.777777777777779) internal successors, (142), 10 states have internal predecessors, (142), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-09 12:10:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2024-11-09 12:10:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 12:10:14,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:14,371 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:10:14,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 12:10:14,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 12:10:14,572 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-11-09 12:10:14,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:14,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2132921880, now seen corresponding path program 1 times [2024-11-09 12:10:14,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:14,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780019554] [2024-11-09 12:10:14,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:14,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:10:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:14,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 12:10:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:14,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 12:10:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:14,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 12:10:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:14,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 12:10:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:14,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 12:10:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:14,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:10:14,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780019554] [2024-11-09 12:10:14,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780019554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:10:14,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128914880] [2024-11-09 12:10:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:14,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:14,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:14,709 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:10:14,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 12:10:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:10:14,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 12:10:14,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:10:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:10:14,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:10:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128914880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:10:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:10:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-09 12:10:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343631327] [2024-11-09 12:10:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:10:14,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:10:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:10:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:10:14,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:10:14,950 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 12:10:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:10:14,992 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2024-11-09 12:10:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:10:14,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2024-11-09 12:10:14,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:10:14,993 INFO L225 Difference]: With dead ends: 77 [2024-11-09 12:10:14,993 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 12:10:14,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:10:14,994 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 18 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:10:14,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 93 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:10:14,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 12:10:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 12:10:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:10:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 12:10:14,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2024-11-09 12:10:14,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:10:14,995 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 12:10:14,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 12:10:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 12:10:14,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 12:10:14,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 52 remaining) [2024-11-09 12:10:14,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 52 remaining) [2024-11-09 12:10:14,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 52 remaining) [2024-11-09 12:10:14,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 52 remaining) [2024-11-09 12:10:14,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 52 remaining) [2024-11-09 12:10:14,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 52 remaining) [2024-11-09 12:10:14,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 52 remaining) [2024-11-09 12:10:14,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 52 remaining) [2024-11-09 12:10:14,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 52 remaining) [2024-11-09 12:10:14,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 52 remaining) [2024-11-09 12:10:14,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 52 remaining) [2024-11-09 12:10:14,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 52 remaining) [2024-11-09 12:10:14,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 52 remaining) [2024-11-09 12:10:14,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 52 remaining) [2024-11-09 12:10:14,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 52 remaining) [2024-11-09 12:10:14,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 52 remaining) [2024-11-09 12:10:14,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 52 remaining) [2024-11-09 12:10:15,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 52 remaining) [2024-11-09 12:10:15,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 52 remaining) [2024-11-09 12:10:15,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 52 remaining) [2024-11-09 12:10:15,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 52 remaining) [2024-11-09 12:10:15,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 52 remaining) [2024-11-09 12:10:15,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 52 remaining) [2024-11-09 12:10:15,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 52 remaining) [2024-11-09 12:10:15,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 52 remaining) [2024-11-09 12:10:15,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 52 remaining) [2024-11-09 12:10:15,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 52 remaining) [2024-11-09 12:10:15,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 52 remaining) [2024-11-09 12:10:15,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 52 remaining) [2024-11-09 12:10:15,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 52 remaining) [2024-11-09 12:10:15,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 52 remaining) [2024-11-09 12:10:15,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 52 remaining) [2024-11-09 12:10:15,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 52 remaining) [2024-11-09 12:10:15,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 52 remaining) [2024-11-09 12:10:15,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 52 remaining) [2024-11-09 12:10:15,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 52 remaining) [2024-11-09 12:10:15,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 52 remaining) [2024-11-09 12:10:15,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 52 remaining) [2024-11-09 12:10:15,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 52 remaining) [2024-11-09 12:10:15,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 52 remaining) [2024-11-09 12:10:15,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 52 remaining) [2024-11-09 12:10:15,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 52 remaining) [2024-11-09 12:10:15,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 52 remaining) [2024-11-09 12:10:15,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 52 remaining) [2024-11-09 12:10:15,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 52 remaining) [2024-11-09 12:10:15,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 52 remaining) [2024-11-09 12:10:15,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 52 remaining) [2024-11-09 12:10:15,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 52 remaining) [2024-11-09 12:10:15,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 52 remaining) [2024-11-09 12:10:15,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 52 remaining) [2024-11-09 12:10:15,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 52 remaining) [2024-11-09 12:10:15,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 52 remaining) [2024-11-09 12:10:15,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 12:10:15,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:10:15,207 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-09 12:10:15,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 12:10:15,307 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 12:10:15,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:10:15 BoogieIcfgContainer [2024-11-09 12:10:15,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 12:10:15,344 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 12:10:15,344 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 12:10:15,344 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 12:10:15,344 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:10:06" (3/4) ... [2024-11-09 12:10:15,346 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 12:10:15,353 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 12:10:15,361 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-09 12:10:15,364 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 12:10:15,364 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 12:10:15,365 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 12:10:15,473 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 12:10:15,474 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 12:10:15,474 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 12:10:15,474 INFO L158 Benchmark]: Toolchain (without parser) took 9873.41ms. Allocated memory was 161.5MB in the beginning and 209.7MB in the end (delta: 48.2MB). Free memory was 93.0MB in the beginning and 103.7MB in the end (delta: -10.7MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2024-11-09 12:10:15,474 INFO L158 Benchmark]: CDTParser took 3.33ms. Allocated memory is still 102.8MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:10:15,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.05ms. Allocated memory is still 161.5MB. Free memory was 92.8MB in the beginning and 127.9MB in the end (delta: -35.1MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-09 12:10:15,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.02ms. Allocated memory is still 161.5MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:10:15,475 INFO L158 Benchmark]: Boogie Preprocessor took 52.00ms. Allocated memory is still 161.5MB. Free memory was 125.8MB in the beginning and 124.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:10:15,475 INFO L158 Benchmark]: RCFGBuilder took 582.60ms. Allocated memory is still 161.5MB. Free memory was 124.1MB in the beginning and 105.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 12:10:15,476 INFO L158 Benchmark]: TraceAbstraction took 8709.95ms. Allocated memory was 161.5MB in the beginning and 209.7MB in the end (delta: 48.2MB). Free memory was 104.4MB in the beginning and 108.9MB in the end (delta: -4.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-09 12:10:15,476 INFO L158 Benchmark]: Witness Printer took 130.25ms. Allocated memory is still 209.7MB. Free memory was 108.9MB in the beginning and 103.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 12:10:15,477 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.33ms. Allocated memory is still 102.8MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.05ms. Allocated memory is still 161.5MB. Free memory was 92.8MB in the beginning and 127.9MB in the end (delta: -35.1MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.02ms. Allocated memory is still 161.5MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.00ms. Allocated memory is still 161.5MB. Free memory was 125.8MB in the beginning and 124.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 582.60ms. Allocated memory is still 161.5MB. Free memory was 124.1MB in the beginning and 105.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8709.95ms. Allocated memory was 161.5MB in the beginning and 209.7MB in the end (delta: 48.2MB). Free memory was 104.4MB in the beginning and 108.9MB in the end (delta: -4.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 130.25ms. Allocated memory is still 209.7MB. Free memory was 108.9MB in the beginning and 103.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 52 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1036 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1002 mSDsluCounter, 3626 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1901 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1252 IncrementalHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 1725 mSDtfsCounter, 1252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1137 GetRequests, 1064 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=6, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 206 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1445 NumberOfCodeBlocks, 1445 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1666 ConstructedInterpolants, 0 QuantifiedInterpolants, 6300 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1092 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 31 InterpolantComputations, 13 PerfectInterpolantSequences, 686/756 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 52 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((t == 1) && (counter == 0)) && (a == 0)) && (s == 1)) || ((((3 == t) && (a == 1)) && (s == 4)) && (counter == 1))) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-09 12:10:15,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE