./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:12:31,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:12:31,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:12:31,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:12:31,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:12:31,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:12:31,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:12:31,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:12:31,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:12:31,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:12:31,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:12:31,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:12:31,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:12:31,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:12:31,572 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:12:31,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:12:31,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:12:31,572 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:12:31,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:12:31,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:12:31,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:12:31,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:12:31,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:12:31,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:12:31,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:12:31,574 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:12:31,574 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:12:31,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:12:31,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:12:31,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:12:31,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:12:31,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:12:31,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:12:31,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:12:31,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:12:31,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:12:31,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:12:31,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:12:31,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:12:31,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:12:31,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:12:31,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:12:31,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:12:31,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:12:31,577 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 -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 [2024-10-13 13:12:31,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:12:31,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:12:31,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:12:31,785 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:12:31,785 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:12:31,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-10-13 13:12:33,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:12:33,185 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:12:33,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-10-13 13:12:33,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9ddb2b2/98b9f2b74597487cb0ad9e605dfa2192/FLAG5b018dd25 [2024-10-13 13:12:33,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9ddb2b2/98b9f2b74597487cb0ad9e605dfa2192 [2024-10-13 13:12:33,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:12:33,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:12:33,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:12:33,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:12:33,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:12:33,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eee68a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33, skipping insertion in model container [2024-10-13 13:12:33,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:12:33,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:12:33,411 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:12:33,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:12:33,447 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:12:33,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33 WrapperNode [2024-10-13 13:12:33,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:12:33,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:12:33,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:12:33,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:12:33,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,484 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 160 [2024-10-13 13:12:33,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:12:33,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:12:33,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:12:33,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:12:33,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,515 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 13:12:33,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:12:33,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:12:33,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:12:33,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:12:33,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33" (1/1) ... [2024-10-13 13:12:33,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:12:33,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:33,557 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-10-13 13:12:33,560 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-10-13 13:12:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:12:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:12:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:12:33,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:12:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 13:12:33,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 13:12:33,643 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:12:33,646 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:12:33,897 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-10-13 13:12:33,898 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:12:33,919 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:12:33,920 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 13:12:33,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:12:33 BoogieIcfgContainer [2024-10-13 13:12:33,920 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:12:33,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:12:33,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:12:33,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:12:33,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:12:33" (1/3) ... [2024-10-13 13:12:33,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32726d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:12:33, skipping insertion in model container [2024-10-13 13:12:33,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:12:33" (2/3) ... [2024-10-13 13:12:33,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32726d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:12:33, skipping insertion in model container [2024-10-13 13:12:33,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:12:33" (3/3) ... [2024-10-13 13:12:33,929 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2024-10-13 13:12:33,942 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:12:33,942 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-13 13:12:33,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:12:34,001 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;@208c03e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:12:34,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-10-13 13:12:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 57 states have (on average 1.894736842105263) internal successors, (108), 90 states have internal predecessors, (108), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 13:12:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 13:12:34,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:34,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:34,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:34,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:34,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1695015777, now seen corresponding path program 1 times [2024-10-13 13:12:34,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:34,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611113339] [2024-10-13 13:12:34,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:34,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:12:34,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:34,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611113339] [2024-10-13 13:12:34,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611113339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:34,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:34,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:12:34,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348272125] [2024-10-13 13:12:34,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:34,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:34,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:34,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:34,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:34,189 INFO L87 Difference]: Start difference. First operand has 107 states, 57 states have (on average 1.894736842105263) internal successors, (108), 90 states have internal predecessors, (108), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:34,275 INFO L93 Difference]: Finished difference Result 193 states and 280 transitions. [2024-10-13 13:12:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:34,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 13:12:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:34,283 INFO L225 Difference]: With dead ends: 193 [2024-10-13 13:12:34,283 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 13:12:34,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:34,288 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 76 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:34,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 130 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 13:12:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-13 13:12:34,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 80 states have internal predecessors, (83), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 13:12:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2024-10-13 13:12:34,323 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 9 [2024-10-13 13:12:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:34,323 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2024-10-13 13:12:34,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2024-10-13 13:12:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 13:12:34,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:34,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:34,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:12:34,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:34,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1005883126, now seen corresponding path program 1 times [2024-10-13 13:12:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:34,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690996286] [2024-10-13 13:12:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:12:34,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:34,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690996286] [2024-10-13 13:12:34,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690996286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:34,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:34,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:12:34,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590328460] [2024-10-13 13:12:34,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:34,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:34,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:34,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:34,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:34,368 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:34,390 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2024-10-13 13:12:34,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:34,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 13:12:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:34,396 INFO L225 Difference]: With dead ends: 183 [2024-10-13 13:12:34,396 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 13:12:34,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:34,397 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:34,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 13:12:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-13 13:12:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 80 states have internal predecessors, (82), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 13:12:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-10-13 13:12:34,416 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 10 [2024-10-13 13:12:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:34,417 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-10-13 13:12:34,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-10-13 13:12:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 13:12:34,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:34,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:34,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:12:34,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:34,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:34,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1005881460, now seen corresponding path program 1 times [2024-10-13 13:12:34,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:34,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841910626] [2024-10-13 13:12:34,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:34,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:12:34,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:34,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841910626] [2024-10-13 13:12:34,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841910626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:34,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:34,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 13:12:34,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491172871] [2024-10-13 13:12:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:34,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:34,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:34,463 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:34,502 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2024-10-13 13:12:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:34,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 13:12:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:34,503 INFO L225 Difference]: With dead ends: 97 [2024-10-13 13:12:34,503 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 13:12:34,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:34,505 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 65 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:34,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 116 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 13:12:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-13 13:12:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 13:12:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2024-10-13 13:12:34,516 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 10 [2024-10-13 13:12:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:34,518 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2024-10-13 13:12:34,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2024-10-13 13:12:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 13:12:34,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:34,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:34,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:12:34,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:34,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:34,523 INFO L85 PathProgramCache]: Analyzing trace with hash -284438866, now seen corresponding path program 1 times [2024-10-13 13:12:34,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:34,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301324463] [2024-10-13 13:12:34,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:34,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:12:34,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:34,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301324463] [2024-10-13 13:12:34,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301324463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:34,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:34,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:12:34,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056922624] [2024-10-13 13:12:34,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:34,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:12:34,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:34,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:12:34,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:12:34,583 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:34,661 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2024-10-13 13:12:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:12:34,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 13:12:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:34,662 INFO L225 Difference]: With dead ends: 92 [2024-10-13 13:12:34,662 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 13:12:34,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:12:34,664 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 44 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:34,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 169 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 13:12:34,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 13:12:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 67 states have internal predecessors, (69), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 13:12:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2024-10-13 13:12:34,680 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 12 [2024-10-13 13:12:34,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:34,680 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2024-10-13 13:12:34,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2024-10-13 13:12:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 13:12:34,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:34,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:34,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:12:34,681 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:34,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash -227670169, now seen corresponding path program 1 times [2024-10-13 13:12:34,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:34,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392898309] [2024-10-13 13:12:34,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:34,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:12:34,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:34,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392898309] [2024-10-13 13:12:34,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392898309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:34,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:34,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:12:34,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534195949] [2024-10-13 13:12:34,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:34,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:12:34,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:34,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:12:34,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:12:34,739 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:34,814 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2024-10-13 13:12:34,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:12:34,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-13 13:12:34,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:34,817 INFO L225 Difference]: With dead ends: 115 [2024-10-13 13:12:34,818 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 13:12:34,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:12:34,819 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 25 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:34,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 223 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 13:12:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-13 13:12:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 13:12:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2024-10-13 13:12:34,835 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 13 [2024-10-13 13:12:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:34,835 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2024-10-13 13:12:34,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:12:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2024-10-13 13:12:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 13:12:34,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:34,837 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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-10-13 13:12:34,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:12:34,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:34,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:34,838 INFO L85 PathProgramCache]: Analyzing trace with hash -206244278, now seen corresponding path program 1 times [2024-10-13 13:12:34,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:34,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183765672] [2024-10-13 13:12:34,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:34,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:35,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 13:12:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:35,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 13:12:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:35,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 13:12:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:35,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:12:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:35,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 13:12:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:35,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 13:12:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:35,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 13:12:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:35,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 13:12:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 13:12:35,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:35,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183765672] [2024-10-13 13:12:35,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183765672] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:35,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484115188] [2024-10-13 13:12:35,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:35,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:35,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:35,092 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-10-13 13:12:35,096 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-10-13 13:12:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:35,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:12:35,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 13:12:35,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:12:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 13:12:35,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484115188] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:12:35,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:12:35,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2024-10-13 13:12:35,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104723104] [2024-10-13 13:12:35,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:12:35,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 13:12:35,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:35,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 13:12:35,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-13 13:12:35,353 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 11 states, 10 states have (on average 8.1) internal successors, (81), 11 states have internal predecessors, (81), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2024-10-13 13:12:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:35,797 INFO L93 Difference]: Finished difference Result 322 states and 447 transitions. [2024-10-13 13:12:35,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 13:12:35,798 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.1) internal successors, (81), 11 states have internal predecessors, (81), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 69 [2024-10-13 13:12:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:35,801 INFO L225 Difference]: With dead ends: 322 [2024-10-13 13:12:35,801 INFO L226 Difference]: Without dead ends: 316 [2024-10-13 13:12:35,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-10-13 13:12:35,804 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 503 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:35,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 426 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 13:12:35,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-13 13:12:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 282. [2024-10-13 13:12:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 196 states have (on average 1.2295918367346939) internal successors, (241), 211 states have internal predecessors, (241), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 13:12:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 397 transitions. [2024-10-13 13:12:35,845 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 397 transitions. Word has length 69 [2024-10-13 13:12:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:35,846 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 397 transitions. [2024-10-13 13:12:35,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.1) internal successors, (81), 11 states have internal predecessors, (81), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2024-10-13 13:12:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 397 transitions. [2024-10-13 13:12:35,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 13:12:35,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:35,848 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:35,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 13:12:36,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 13:12:36,053 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:36,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:36,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1693853084, now seen corresponding path program 1 times [2024-10-13 13:12:36,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:36,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152402377] [2024-10-13 13:12:36,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:36,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 13:12:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 13:12:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 13:12:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:12:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 13:12:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 13:12:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-13 13:12:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 13:12:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 13:12:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 13:12:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 13:12:36,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:36,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152402377] [2024-10-13 13:12:36,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152402377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:36,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:36,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:12:36,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808714720] [2024-10-13 13:12:36,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:36,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:36,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:36,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:36,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:36,127 INFO L87 Difference]: Start difference. First operand 282 states and 397 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-13 13:12:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:36,199 INFO L93 Difference]: Finished difference Result 402 states and 578 transitions. [2024-10-13 13:12:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:36,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2024-10-13 13:12:36,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:36,202 INFO L225 Difference]: With dead ends: 402 [2024-10-13 13:12:36,203 INFO L226 Difference]: Without dead ends: 282 [2024-10-13 13:12:36,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:36,206 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:36,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-13 13:12:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-10-13 13:12:36,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 196 states have (on average 1.1989795918367347) internal successors, (235), 211 states have internal predecessors, (235), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 13:12:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 391 transitions. [2024-10-13 13:12:36,223 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 391 transitions. Word has length 89 [2024-10-13 13:12:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:36,224 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 391 transitions. [2024-10-13 13:12:36,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-13 13:12:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 391 transitions. [2024-10-13 13:12:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 13:12:36,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:36,226 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:36,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 13:12:36,226 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:36,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1071833793, now seen corresponding path program 1 times [2024-10-13 13:12:36,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:36,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082309928] [2024-10-13 13:12:36,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:36,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 13:12:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 13:12:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 13:12:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:12:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 13:12:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 13:12:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 13:12:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 13:12:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 13:12:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 13:12:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 13:12:36,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:36,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082309928] [2024-10-13 13:12:36,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082309928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:36,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:36,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:12:36,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292618505] [2024-10-13 13:12:36,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:36,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:36,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:36,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:36,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:36,303 INFO L87 Difference]: Start difference. First operand 282 states and 391 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 13:12:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:36,324 INFO L93 Difference]: Finished difference Result 282 states and 391 transitions. [2024-10-13 13:12:36,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:36,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 90 [2024-10-13 13:12:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:36,327 INFO L225 Difference]: With dead ends: 282 [2024-10-13 13:12:36,327 INFO L226 Difference]: Without dead ends: 281 [2024-10-13 13:12:36,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:36,328 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:36,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 114 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-13 13:12:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-13 13:12:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 196 states have (on average 1.1734693877551021) internal successors, (230), 210 states have internal predecessors, (230), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 13:12:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 386 transitions. [2024-10-13 13:12:36,350 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 386 transitions. Word has length 90 [2024-10-13 13:12:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:36,352 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 386 transitions. [2024-10-13 13:12:36,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 13:12:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 386 transitions. [2024-10-13 13:12:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 13:12:36,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:36,355 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:36,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 13:12:36,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:36,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:36,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1132890603, now seen corresponding path program 1 times [2024-10-13 13:12:36,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:36,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299221396] [2024-10-13 13:12:36,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:36,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 13:12:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 13:12:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 13:12:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:12:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 13:12:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 13:12:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 13:12:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 13:12:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 13:12:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 13:12:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 13:12:36,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:36,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299221396] [2024-10-13 13:12:36,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299221396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:36,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:36,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:12:36,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168086419] [2024-10-13 13:12:36,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:36,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:36,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:36,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:36,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:36,429 INFO L87 Difference]: Start difference. First operand 281 states and 386 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 13:12:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:36,446 INFO L93 Difference]: Finished difference Result 281 states and 386 transitions. [2024-10-13 13:12:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:36,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 91 [2024-10-13 13:12:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:36,448 INFO L225 Difference]: With dead ends: 281 [2024-10-13 13:12:36,449 INFO L226 Difference]: Without dead ends: 280 [2024-10-13 13:12:36,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:36,450 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:36,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-13 13:12:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2024-10-13 13:12:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.1479591836734695) internal successors, (225), 209 states have internal predecessors, (225), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 13:12:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 381 transitions. [2024-10-13 13:12:36,469 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 381 transitions. Word has length 91 [2024-10-13 13:12:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:36,470 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 381 transitions. [2024-10-13 13:12:36,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 13:12:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2024-10-13 13:12:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 13:12:36,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:36,472 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:36,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 13:12:36,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:36,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:36,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2010672774, now seen corresponding path program 1 times [2024-10-13 13:12:36,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:36,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566896086] [2024-10-13 13:12:36,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:36,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 13:12:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 13:12:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 13:12:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:12:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 13:12:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 13:12:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 13:12:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 13:12:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 13:12:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 13:12:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 13:12:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 13:12:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 13:12:36,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:36,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566896086] [2024-10-13 13:12:36,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566896086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:36,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:36,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:12:36,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617921888] [2024-10-13 13:12:36,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:36,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:36,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:36,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:36,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:36,552 INFO L87 Difference]: Start difference. First operand 280 states and 381 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 13:12:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:36,581 INFO L93 Difference]: Finished difference Result 376 states and 523 transitions. [2024-10-13 13:12:36,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:36,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-10-13 13:12:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:36,583 INFO L225 Difference]: With dead ends: 376 [2024-10-13 13:12:36,583 INFO L226 Difference]: Without dead ends: 280 [2024-10-13 13:12:36,584 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-10-13 13:12:36,585 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:36,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-13 13:12:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2024-10-13 13:12:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.1224489795918366) internal successors, (220), 209 states have internal predecessors, (220), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 13:12:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 376 transitions. [2024-10-13 13:12:36,608 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 376 transitions. Word has length 103 [2024-10-13 13:12:36,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:36,608 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 376 transitions. [2024-10-13 13:12:36,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 13:12:36,608 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 376 transitions. [2024-10-13 13:12:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 13:12:36,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:36,610 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:36,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 13:12:36,610 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:36,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2146032074, now seen corresponding path program 1 times [2024-10-13 13:12:36,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:36,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923360704] [2024-10-13 13:12:36,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:36,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 13:12:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 13:12:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 13:12:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:12:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 13:12:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 13:12:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 13:12:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 13:12:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 13:12:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 13:12:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 13:12:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 13:12:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 13:12:36,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:36,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923360704] [2024-10-13 13:12:36,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923360704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:36,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:12:36,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:12:36,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904038378] [2024-10-13 13:12:36,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:36,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:12:36,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:36,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:12:36,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:36,687 INFO L87 Difference]: Start difference. First operand 280 states and 376 transitions. Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 13:12:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:36,713 INFO L93 Difference]: Finished difference Result 341 states and 455 transitions. [2024-10-13 13:12:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:12:36,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-10-13 13:12:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:36,715 INFO L225 Difference]: With dead ends: 341 [2024-10-13 13:12:36,715 INFO L226 Difference]: Without dead ends: 339 [2024-10-13 13:12:36,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:12:36,716 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 5 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:36,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 177 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-13 13:12:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 338. [2024-10-13 13:12:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 246 states have (on average 1.1097560975609757) internal successors, (273), 258 states have internal predecessors, (273), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-13 13:12:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 445 transitions. [2024-10-13 13:12:36,734 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 445 transitions. Word has length 105 [2024-10-13 13:12:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:36,735 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 445 transitions. [2024-10-13 13:12:36,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 13:12:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 445 transitions. [2024-10-13 13:12:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 13:12:36,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:36,736 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:36,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 13:12:36,737 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:36,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2135030018, now seen corresponding path program 2 times [2024-10-13 13:12:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:36,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442996667] [2024-10-13 13:12:36,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:36,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 13:12:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 13:12:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 13:12:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:12:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 13:12:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 13:12:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 13:12:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 13:12:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 13:12:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 13:12:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 13:12:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 13:12:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-13 13:12:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 13:12:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 13:12:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 13:12:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 13:12:36,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:36,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442996667] [2024-10-13 13:12:36,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442996667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:36,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445976964] [2024-10-13 13:12:36,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:12:36,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:36,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:36,925 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-10-13 13:12:36,936 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-10-13 13:12:36,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 13:12:36,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:12:36,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 13:12:36,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 13:12:37,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:12:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 13:12:37,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445976964] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:12:37,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:12:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-10-13 13:12:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534126617] [2024-10-13 13:12:37,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:12:37,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 13:12:37,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:37,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 13:12:37,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-10-13 13:12:37,309 INFO L87 Difference]: Start difference. First operand 338 states and 445 transitions. Second operand has 18 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2024-10-13 13:12:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:38,336 INFO L93 Difference]: Finished difference Result 788 states and 1047 transitions. [2024-10-13 13:12:38,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 13:12:38,337 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) Word has length 133 [2024-10-13 13:12:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:38,342 INFO L225 Difference]: With dead ends: 788 [2024-10-13 13:12:38,342 INFO L226 Difference]: Without dead ends: 785 [2024-10-13 13:12:38,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=305, Invalid=687, Unknown=0, NotChecked=0, Total=992 [2024-10-13 13:12:38,343 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 2050 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 880 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 880 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:38,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 435 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [880 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 13:12:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-13 13:12:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 765. [2024-10-13 13:12:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 561 states have (on average 1.1105169340463459) internal successors, (623), 587 states have internal predecessors, (623), 198 states have call successors, (198), 1 states have call predecessors, (198), 1 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2024-10-13 13:12:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1019 transitions. [2024-10-13 13:12:38,384 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1019 transitions. Word has length 133 [2024-10-13 13:12:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:38,385 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1019 transitions. [2024-10-13 13:12:38,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2024-10-13 13:12:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1019 transitions. [2024-10-13 13:12:38,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 13:12:38,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:38,388 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:38,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 13:12:38,592 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-10-13 13:12:38,593 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:38,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:38,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1539023991, now seen corresponding path program 1 times [2024-10-13 13:12:38,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:38,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872135209] [2024-10-13 13:12:38,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:38,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 13:12:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 13:12:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 13:12:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:12:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 13:12:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 13:12:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 13:12:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 13:12:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 13:12:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 13:12:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 13:12:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 13:12:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 13:12:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 13:12:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 13:12:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 13:12:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 13:12:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 13:12:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 13:12:38,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872135209] [2024-10-13 13:12:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872135209] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394141154] [2024-10-13 13:12:38,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:38,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:38,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:38,706 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-10-13 13:12:38,707 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-10-13 13:12:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:38,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 13:12:38,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 13:12:38,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:12:38,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394141154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:12:38,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:12:38,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-13 13:12:38,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210618570] [2024-10-13 13:12:38,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:12:38,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:12:38,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:38,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:12:38,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:12:38,819 INFO L87 Difference]: Start difference. First operand 765 states and 1019 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-13 13:12:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:38,860 INFO L93 Difference]: Finished difference Result 766 states and 1019 transitions. [2024-10-13 13:12:38,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:12:38,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2024-10-13 13:12:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:38,864 INFO L225 Difference]: With dead ends: 766 [2024-10-13 13:12:38,864 INFO L226 Difference]: Without dead ends: 765 [2024-10-13 13:12:38,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:12:38,865 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:38,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 186 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:12:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-13 13:12:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 764. [2024-10-13 13:12:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 561 states have (on average 1.0909090909090908) internal successors, (612), 586 states have internal predecessors, (612), 198 states have call successors, (198), 1 states have call predecessors, (198), 1 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2024-10-13 13:12:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1008 transitions. [2024-10-13 13:12:38,922 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1008 transitions. Word has length 147 [2024-10-13 13:12:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:38,922 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1008 transitions. [2024-10-13 13:12:38,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-13 13:12:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1008 transitions. [2024-10-13 13:12:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 13:12:38,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:38,925 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:38,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 13:12:39,125 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-10-13 13:12:39,126 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:39,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:39,126 INFO L85 PathProgramCache]: Analyzing trace with hash 465103665, now seen corresponding path program 1 times [2024-10-13 13:12:39,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:39,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143168870] [2024-10-13 13:12:39,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:39,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 13:12:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 13:12:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 13:12:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:12:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 13:12:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 13:12:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 13:12:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 13:12:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 13:12:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 13:12:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 13:12:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 13:12:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 13:12:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 13:12:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 13:12:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 13:12:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 13:12:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 13:12:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 13:12:39,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:39,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143168870] [2024-10-13 13:12:39,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143168870] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:39,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934884607] [2024-10-13 13:12:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:39,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:39,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:39,230 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-10-13 13:12:39,232 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-10-13 13:12:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:39,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 13:12:39,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 13:12:39,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:12:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 13:12:39,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934884607] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:12:39,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:12:39,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-13 13:12:39,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613277588] [2024-10-13 13:12:39,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:12:39,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:12:39,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:39,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:12:39,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:12:39,443 INFO L87 Difference]: Start difference. First operand 764 states and 1008 transitions. Second operand has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2024-10-13 13:12:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:39,554 INFO L93 Difference]: Finished difference Result 1273 states and 1743 transitions. [2024-10-13 13:12:39,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:12:39,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 148 [2024-10-13 13:12:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:39,561 INFO L225 Difference]: With dead ends: 1273 [2024-10-13 13:12:39,561 INFO L226 Difference]: Without dead ends: 1272 [2024-10-13 13:12:39,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 328 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-10-13 13:12:39,563 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 16 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:39,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 289 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2024-10-13 13:12:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1268. [2024-10-13 13:12:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 891 states have (on average 1.0875420875420876) internal successors, (969), 943 states have internal predecessors, (969), 372 states have call successors, (372), 1 states have call predecessors, (372), 1 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2024-10-13 13:12:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1713 transitions. [2024-10-13 13:12:39,682 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1713 transitions. Word has length 148 [2024-10-13 13:12:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:39,683 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1713 transitions. [2024-10-13 13:12:39,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2024-10-13 13:12:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1713 transitions. [2024-10-13 13:12:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-13 13:12:39,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:39,691 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:39,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 13:12:39,891 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-10-13 13:12:39,892 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:39,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash -591541447, now seen corresponding path program 3 times [2024-10-13 13:12:39,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:39,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853359923] [2024-10-13 13:12:39,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:39,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 13:12:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 13:12:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 13:12:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:12:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 13:12:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 13:12:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 13:12:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 13:12:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 13:12:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 13:12:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 13:12:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 13:12:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-13 13:12:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 13:12:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 13:12:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 13:12:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 13:12:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 13:12:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 13:12:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 13:12:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 13:12:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 13:12:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 13:12:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-13 13:12:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-13 13:12:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-13 13:12:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-13 13:12:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-13 13:12:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-10-13 13:12:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-10-13 13:12:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:40,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 0 proven. 624 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 13:12:40,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:40,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853359923] [2024-10-13 13:12:40,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853359923] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:40,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783171414] [2024-10-13 13:12:40,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 13:12:40,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:40,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:40,315 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-10-13 13:12:40,316 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-10-13 13:12:40,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 13:12:40,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:12:40,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 13:12:40,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2024-10-13 13:12:40,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:12:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 84 proven. 63 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2024-10-13 13:12:40,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783171414] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:12:40,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:12:40,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 24 [2024-10-13 13:12:40,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664310654] [2024-10-13 13:12:40,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:12:40,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 13:12:40,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:40,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 13:12:40,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2024-10-13 13:12:40,790 INFO L87 Difference]: Start difference. First operand 1268 states and 1713 transitions. Second operand has 25 states, 24 states have (on average 6.125) internal successors, (147), 25 states have internal predecessors, (147), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2024-10-13 13:12:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:41,128 INFO L93 Difference]: Finished difference Result 1345 states and 1801 transitions. [2024-10-13 13:12:41,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 13:12:41,129 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.125) internal successors, (147), 25 states have internal predecessors, (147), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) Word has length 245 [2024-10-13 13:12:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:41,135 INFO L225 Difference]: With dead ends: 1345 [2024-10-13 13:12:41,135 INFO L226 Difference]: Without dead ends: 1342 [2024-10-13 13:12:41,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2024-10-13 13:12:41,136 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 147 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:41,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 234 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:12:41,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2024-10-13 13:12:41,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 141. [2024-10-13 13:12:41,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 107 states have internal predecessors, (108), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 13:12:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 184 transitions. [2024-10-13 13:12:41,166 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 184 transitions. Word has length 245 [2024-10-13 13:12:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:41,166 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 184 transitions. [2024-10-13 13:12:41,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.125) internal successors, (147), 25 states have internal predecessors, (147), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2024-10-13 13:12:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 184 transitions. [2024-10-13 13:12:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-13 13:12:41,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:12:41,168 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:41,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 13:12:41,369 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-10-13 13:12:41,369 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-13 13:12:41,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:12:41,370 INFO L85 PathProgramCache]: Analyzing trace with hash -958996402, now seen corresponding path program 2 times [2024-10-13 13:12:41,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:12:41,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623959492] [2024-10-13 13:12:41,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:12:41,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:12:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 13:12:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 13:12:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 13:12:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:12:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 13:12:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 13:12:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 13:12:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 13:12:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 13:12:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 13:12:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 13:12:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 13:12:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 13:12:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 13:12:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 13:12:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 13:12:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 13:12:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 13:12:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 13:12:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 13:12:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 13:12:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 13:12:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-13 13:12:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 13:12:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-13 13:12:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-13 13:12:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-13 13:12:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-13 13:12:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 13:12:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-10-13 13:12:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-13 13:12:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-13 13:12:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-13 13:12:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-13 13:12:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-13 13:12:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-13 13:12:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:12:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2610 trivial. 0 not checked. [2024-10-13 13:12:41,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:12:41,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623959492] [2024-10-13 13:12:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623959492] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:12:41,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670799577] [2024-10-13 13:12:41,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:12:41,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:12:41,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:12:41,558 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-10-13 13:12:41,559 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-10-13 13:12:41,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 13:12:41,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:12:41,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 13:12:41,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:12:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 13:12:41,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:12:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 13:12:41,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670799577] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:12:41,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:12:41,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2024-10-13 13:12:41,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88053180] [2024-10-13 13:12:41,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:12:41,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 13:12:41,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:12:41,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 13:12:41,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2024-10-13 13:12:41,945 INFO L87 Difference]: Start difference. First operand 141 states and 184 transitions. Second operand has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2024-10-13 13:12:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:12:42,090 INFO L93 Difference]: Finished difference Result 171 states and 226 transitions. [2024-10-13 13:12:42,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 13:12:42,090 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) Word has length 274 [2024-10-13 13:12:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:12:42,091 INFO L225 Difference]: With dead ends: 171 [2024-10-13 13:12:42,091 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 13:12:42,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=219, Invalid=333, Unknown=0, NotChecked=0, Total=552 [2024-10-13 13:12:42,092 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 54 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:12:42,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 286 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:12:42,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 13:12:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 13:12:42,093 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-10-13 13:12:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 13:12:42,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 274 [2024-10-13 13:12:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:12:42,093 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 13:12:42,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2024-10-13 13:12:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 13:12:42,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 13:12:42,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2024-10-13 13:12:42,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2024-10-13 13:12:42,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2024-10-13 13:12:42,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2024-10-13 13:12:42,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2024-10-13 13:12:42,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2024-10-13 13:12:42,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2024-10-13 13:12:42,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2024-10-13 13:12:42,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2024-10-13 13:12:42,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2024-10-13 13:12:42,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2024-10-13 13:12:42,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2024-10-13 13:12:42,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2024-10-13 13:12:42,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2024-10-13 13:12:42,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2024-10-13 13:12:42,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2024-10-13 13:12:42,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 13:12:42,300 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-10-13 13:12:42,303 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:12:42,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 13:12:43,141 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:12:43,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:12:43 BoogieIcfgContainer [2024-10-13 13:12:43,160 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:12:43,161 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:12:43,161 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:12:43,161 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:12:43,162 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:12:33" (3/4) ... [2024-10-13 13:12:43,163 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 13:12:43,166 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-13 13:12:43,172 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-13 13:12:43,173 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 13:12:43,173 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 13:12:43,173 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 13:12:43,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:12:43,252 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 13:12:43,252 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:12:43,252 INFO L158 Benchmark]: Toolchain (without parser) took 10038.93ms. Allocated memory was 203.4MB in the beginning and 373.3MB in the end (delta: 169.9MB). Free memory was 135.3MB in the beginning and 332.0MB in the end (delta: -196.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:12:43,252 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 111.1MB. Free memory was 77.4MB in the beginning and 77.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:12:43,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.88ms. Allocated memory is still 203.4MB. Free memory was 135.1MB in the beginning and 122.2MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 13:12:43,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.00ms. Allocated memory is still 203.4MB. Free memory was 122.2MB in the beginning and 120.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:12:43,253 INFO L158 Benchmark]: Boogie Preprocessor took 36.75ms. Allocated memory is still 203.4MB. Free memory was 120.2MB in the beginning and 118.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:12:43,253 INFO L158 Benchmark]: RCFGBuilder took 396.62ms. Allocated memory is still 203.4MB. Free memory was 118.3MB in the beginning and 165.6MB in the end (delta: -47.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 13:12:43,253 INFO L158 Benchmark]: TraceAbstraction took 9238.28ms. Allocated memory was 203.4MB in the beginning and 373.3MB in the end (delta: 169.9MB). Free memory was 165.6MB in the beginning and 338.3MB in the end (delta: -172.8MB). Peak memory consumption was 216.8MB. Max. memory is 16.1GB. [2024-10-13 13:12:43,254 INFO L158 Benchmark]: Witness Printer took 91.00ms. Allocated memory is still 373.3MB. Free memory was 338.3MB in the beginning and 332.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 13:12:43,255 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.71ms. Allocated memory is still 111.1MB. Free memory was 77.4MB in the beginning and 77.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.88ms. Allocated memory is still 203.4MB. Free memory was 135.1MB in the beginning and 122.2MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.00ms. Allocated memory is still 203.4MB. Free memory was 122.2MB in the beginning and 120.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.75ms. Allocated memory is still 203.4MB. Free memory was 120.2MB in the beginning and 118.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 396.62ms. Allocated memory is still 203.4MB. Free memory was 118.3MB in the beginning and 165.6MB in the end (delta: -47.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9238.28ms. Allocated memory was 203.4MB in the beginning and 373.3MB in the end (delta: 169.9MB). Free memory was 165.6MB in the beginning and 338.3MB in the end (delta: -172.8MB). Peak memory consumption was 216.8MB. Max. memory is 16.1GB. * Witness Printer took 91.00ms. Allocated memory is still 373.3MB. Free memory was 338.3MB in the beginning and 332.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: 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, 107 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 16, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3139 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3029 mSDsluCounter, 3473 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2086 mSDsCounter, 1193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1689 IncrementalHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1193 mSolverCounterUnsat, 1387 mSDtfsCounter, 1689 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2333 GetRequests, 2216 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1268occurred in iteration=14, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 1261 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2564 NumberOfCodeBlocks, 2355 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3406 ConstructedInterpolants, 0 QuantifiedInterpolants, 6197 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1504 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 19931/21466 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 30 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((urilen <= 1000000) && (0 <= ((long long) urilen + 1000000))) && (0 <= ((long long) 1000000 + tokenlen))) && (0 <= cp)) && (cp <= 999999)) && (tokenlen <= 1000000)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((((((urilen <= 1000000) && (0 <= ((long long) urilen + 1000000))) && (1 <= c)) && (0 <= ((long long) 1000000 + tokenlen))) && (0 <= cp)) && (cp <= 1000000)) && (c <= 2147483642)) && (tokenlen <= 1000000)) || (((((((c == 0) && (urilen <= 1000000)) && (0 <= ((long long) urilen + 1000000))) && (0 <= ((long long) 1000000 + tokenlen))) && (0 <= cp)) && (cp <= 1000000)) && (tokenlen <= 1000000))) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-13 13:12:43,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE