./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d32da3d6d63cd0b5044f81aaa321c86b8663ab47e67a0d6b64aca0030551d2e0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:12:20,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:12:21,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:12:21,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:12:21,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:12:21,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:12:21,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:12:21,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:12:21,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:12:21,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:12:21,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:12:21,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:12:21,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:12:21,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:12:21,078 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:12:21,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:12:21,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:12:21,078 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:12:21,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:12:21,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:12:21,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:12:21,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:12:21,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:12:21,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:12:21,081 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:12:21,082 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:12:21,082 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:12:21,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:12:21,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:12:21,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:12:21,082 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:12:21,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:12:21,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:12:21,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:12:21,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:12:21,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:12:21,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:12:21,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:12:21,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:12:21,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:12:21,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:12:21,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:12:21,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:12:21,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:12:21,089 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 -> d32da3d6d63cd0b5044f81aaa321c86b8663ab47e67a0d6b64aca0030551d2e0 [2024-11-10 19:12:21,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:12:21,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:12:21,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:12:21,329 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:12:21,329 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:12:21,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound50.c [2024-11-10 19:12:22,604 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:12:22,742 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:12:22,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound50.c [2024-11-10 19:12:22,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/594fa2fda/b2f3e659704d48c19530f706d611ce29/FLAG9c78661e3 [2024-11-10 19:12:22,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/594fa2fda/b2f3e659704d48c19530f706d611ce29 [2024-11-10 19:12:22,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:12:22,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:12:22,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:12:22,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:12:22,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:12:22,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:22,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7089bd80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22, skipping insertion in model container [2024-11-10 19:12:22,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:22,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:12:22,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:12:22,945 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:12:22,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:12:22,973 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:12:22,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22 WrapperNode [2024-11-10 19:12:22,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:12:22,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:12:22,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:12:22,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:12:22,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:22,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:23,002 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2024-11-10 19:12:23,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:12:23,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:12:23,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:12:23,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:12:23,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:23,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:23,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:23,027 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 19:12:23,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:23,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:23,030 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:23,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:23,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:23,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:23,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:12:23,035 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:12:23,035 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:12:23,035 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:12:23,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22" (1/1) ... [2024-11-10 19:12:23,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:12:23,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:12:23,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 19:12:23,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 19:12:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:12:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 19:12:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 19:12:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:12:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:12:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:12:23,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:12:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:12:23,162 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:12:23,164 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:12:23,504 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-10 19:12:23,504 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:12:23,519 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:12:23,520 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:12:23,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:12:23 BoogieIcfgContainer [2024-11-10 19:12:23,520 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:12:23,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:12:23,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:12:23,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:12:23,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:12:22" (1/3) ... [2024-11-10 19:12:23,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a16adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:12:23, skipping insertion in model container [2024-11-10 19:12:23,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:12:22" (2/3) ... [2024-11-10 19:12:23,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a16adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:12:23, skipping insertion in model container [2024-11-10 19:12:23,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:12:23" (3/3) ... [2024-11-10 19:12:23,530 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound50.c [2024-11-10 19:12:23,546 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:12:23,547 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2024-11-10 19:12:23,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:12:23,617 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;@38c02be5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:12:23,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-11-10 19:12:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 80 states have (on average 1.775) internal successors, (142), 136 states have internal predecessors, (142), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:12:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 19:12:23,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:23,630 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:12:23,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:23,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:23,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1266032848, now seen corresponding path program 1 times [2024-11-10 19:12:23,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:23,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298840972] [2024-11-10 19:12:23,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:23,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:23,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:23,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:12:23,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:23,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298840972] [2024-11-10 19:12:23,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298840972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:12:23,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:12:23,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:12:23,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847913893] [2024-11-10 19:12:23,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:12:23,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 19:12:23,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:23,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 19:12:23,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:12:23,849 INFO L87 Difference]: Start difference. First operand has 145 states, 80 states have (on average 1.775) internal successors, (142), 136 states have internal predecessors, (142), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:12:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:23,875 INFO L93 Difference]: Finished difference Result 280 states and 309 transitions. [2024-11-10 19:12:23,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 19:12:23,877 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-11-10 19:12:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:23,882 INFO L225 Difference]: With dead ends: 280 [2024-11-10 19:12:23,883 INFO L226 Difference]: Without dead ends: 132 [2024-11-10 19:12:23,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 19:12:23,888 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:23,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:12:23,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-10 19:12:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-10 19:12:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 75 states have (on average 1.68) internal successors, (126), 124 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:12:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2024-11-10 19:12:23,932 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 14 [2024-11-10 19:12:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:23,932 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2024-11-10 19:12:23,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:12:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2024-11-10 19:12:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 19:12:23,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:23,936 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:12:23,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:12:23,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:23,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:23,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1069549134, now seen corresponding path program 1 times [2024-11-10 19:12:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:23,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245266115] [2024-11-10 19:12:23,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:23,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:24,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:24,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:12:24,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:24,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245266115] [2024-11-10 19:12:24,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245266115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:12:24,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:12:24,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:12:24,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101953751] [2024-11-10 19:12:24,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:12:24,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:12:24,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:24,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:12:24,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:12:24,051 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:12:24,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:24,118 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2024-11-10 19:12:24,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:12:24,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-11-10 19:12:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:24,121 INFO L225 Difference]: With dead ends: 132 [2024-11-10 19:12:24,123 INFO L226 Difference]: Without dead ends: 128 [2024-11-10 19:12:24,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:12:24,124 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 15 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:24,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 211 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:12:24,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-10 19:12:24,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-10 19:12:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 120 states have internal predecessors, (122), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:12:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2024-11-10 19:12:24,142 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 14 [2024-11-10 19:12:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:24,143 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2024-11-10 19:12:24,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:12:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2024-11-10 19:12:24,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 19:12:24,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:24,146 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:12:24,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:12:24,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:24,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:24,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1203715115, now seen corresponding path program 1 times [2024-11-10 19:12:24,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:24,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989432099] [2024-11-10 19:12:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:24,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:24,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:24,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:12:24,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989432099] [2024-11-10 19:12:24,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989432099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:12:24,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:12:24,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:12:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527820434] [2024-11-10 19:12:24,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:12:24,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:12:24,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:24,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:12:24,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:12:24,218 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:12:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:24,266 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2024-11-10 19:12:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:12:24,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-10 19:12:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:24,270 INFO L225 Difference]: With dead ends: 128 [2024-11-10 19:12:24,270 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 19:12:24,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:12:24,271 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 14 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:24,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 211 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:12:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 19:12:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-10 19:12:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 75 states have (on average 1.5733333333333333) internal successors, (118), 116 states have internal predecessors, (118), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:12:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2024-11-10 19:12:24,283 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 15 [2024-11-10 19:12:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:24,283 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2024-11-10 19:12:24,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:12:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2024-11-10 19:12:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 19:12:24,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:24,284 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:12:24,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 19:12:24,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:24,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:24,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1611553169, now seen corresponding path program 1 times [2024-11-10 19:12:24,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:24,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553241167] [2024-11-10 19:12:24,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:24,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:12:24,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078888403] [2024-11-10 19:12:24,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:24,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:24,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:12:24,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:12:24,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 19:12:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:24,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 19:12:24,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:12:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:12:24,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:12:24,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:24,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553241167] [2024-11-10 19:12:24,444 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:12:24,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078888403] [2024-11-10 19:12:24,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078888403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:12:24,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:12:24,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:12:24,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680274352] [2024-11-10 19:12:24,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:12:24,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:12:24,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:24,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:12:24,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:12:24,446 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:12:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:24,525 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2024-11-10 19:12:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:12:24,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-10 19:12:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:24,527 INFO L225 Difference]: With dead ends: 124 [2024-11-10 19:12:24,527 INFO L226 Difference]: Without dead ends: 122 [2024-11-10 19:12:24,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:12:24,528 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 10 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:24,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 399 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:12:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-10 19:12:24,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-10 19:12:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 114 states have internal predecessors, (116), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:12:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2024-11-10 19:12:24,535 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 19 [2024-11-10 19:12:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:24,535 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2024-11-10 19:12:24,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:12:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2024-11-10 19:12:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 19:12:24,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:24,536 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:12:24,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 19:12:24,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:24,737 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:24,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:24,738 INFO L85 PathProgramCache]: Analyzing trace with hash -645973435, now seen corresponding path program 1 times [2024-11-10 19:12:24,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:24,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418525787] [2024-11-10 19:12:24,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:24,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:12:24,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [922000070] [2024-11-10 19:12:24,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:24,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:24,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:12:24,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:12:24,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 19:12:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:24,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 19:12:24,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:12:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 19:12:24,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:12:24,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:24,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418525787] [2024-11-10 19:12:24,991 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:12:24,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922000070] [2024-11-10 19:12:24,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922000070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:12:24,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:12:24,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-11-10 19:12:24,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370284030] [2024-11-10 19:12:24,992 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 19:12:24,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:12:24,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:24,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:12:24,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:12:24,993 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:12:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:25,057 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2024-11-10 19:12:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:12:25,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-11-10 19:12:25,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:25,059 INFO L225 Difference]: With dead ends: 122 [2024-11-10 19:12:25,059 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 19:12:25,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:12:25,060 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 86 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:25,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 312 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:12:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 19:12:25,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-10 19:12:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 111 states have internal predecessors, (113), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:12:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2024-11-10 19:12:25,066 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 37 [2024-11-10 19:12:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:25,066 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2024-11-10 19:12:25,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:12:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2024-11-10 19:12:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 19:12:25,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:25,067 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:12:25,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 19:12:25,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:25,268 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:25,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1449660067, now seen corresponding path program 1 times [2024-11-10 19:12:25,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:25,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471658078] [2024-11-10 19:12:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:25,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:25,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:25,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:12:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:25,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:12:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 19:12:25,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:25,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471658078] [2024-11-10 19:12:25,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471658078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:12:25,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441708556] [2024-11-10 19:12:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:25,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:25,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:12:25,513 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:12:25,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 19:12:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:25,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:12:25,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:12:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 19:12:25,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:12:25,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441708556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:12:25,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:12:25,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-10 19:12:25,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060805040] [2024-11-10 19:12:25,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:12:25,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:12:25,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:25,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:12:25,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:12:25,751 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:12:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:25,831 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2024-11-10 19:12:25,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:12:25,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-11-10 19:12:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:25,832 INFO L225 Difference]: With dead ends: 119 [2024-11-10 19:12:25,832 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 19:12:25,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:12:25,833 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 97 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:25,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 361 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:12:25,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 19:12:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-10 19:12:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 75 states have (on average 1.4933333333333334) internal successors, (112), 110 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:12:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2024-11-10 19:12:25,845 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 38 [2024-11-10 19:12:25,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:25,846 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2024-11-10 19:12:25,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:12:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2024-11-10 19:12:25,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 19:12:25,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:25,846 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:12:25,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 19:12:26,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:26,048 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:26,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1328851202, now seen corresponding path program 1 times [2024-11-10 19:12:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:26,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504276595] [2024-11-10 19:12:26,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:26,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:12:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:12:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:26,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:26,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504276595] [2024-11-10 19:12:26,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504276595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:12:26,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:12:26,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:12:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047997873] [2024-11-10 19:12:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:12:26,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:12:26,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:26,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:12:26,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:12:26,104 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:12:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:26,135 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2024-11-10 19:12:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:12:26,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-10 19:12:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:26,137 INFO L225 Difference]: With dead ends: 122 [2024-11-10 19:12:26,137 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 19:12:26,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:12:26,138 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:26,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 168 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:12:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 19:12:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-10 19:12:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 113 states have internal predecessors, (115), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:12:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2024-11-10 19:12:26,143 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 42 [2024-11-10 19:12:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:26,143 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2024-11-10 19:12:26,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:12:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2024-11-10 19:12:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 19:12:26,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:26,144 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:12:26,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 19:12:26,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:26,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:26,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1755285761, now seen corresponding path program 1 times [2024-11-10 19:12:26,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:26,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378447187] [2024-11-10 19:12:26,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:26,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:12:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:12:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:26,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:26,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378447187] [2024-11-10 19:12:26,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378447187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:12:26,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:12:26,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:12:26,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264155497] [2024-11-10 19:12:26,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:12:26,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:12:26,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:26,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:12:26,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:12:26,186 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:12:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:26,246 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2024-11-10 19:12:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:12:26,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2024-11-10 19:12:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:26,248 INFO L225 Difference]: With dead ends: 123 [2024-11-10 19:12:26,248 INFO L226 Difference]: Without dead ends: 122 [2024-11-10 19:12:26,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:12:26,248 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 48 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:26,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 221 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:12:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-10 19:12:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-10 19:12:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 114 states have internal predecessors, (116), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:12:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2024-11-10 19:12:26,253 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 43 [2024-11-10 19:12:26,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:26,253 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2024-11-10 19:12:26,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:12:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2024-11-10 19:12:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 19:12:26,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:26,254 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:12:26,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 19:12:26,255 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:26,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:26,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1420716196, now seen corresponding path program 1 times [2024-11-10 19:12:26,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:26,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868272780] [2024-11-10 19:12:26,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:26,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:12:26,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939882966] [2024-11-10 19:12:26,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:26,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:26,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:12:26,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:12:26,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 19:12:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 19:12:26,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:12:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:26,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:12:26,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:26,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868272780] [2024-11-10 19:12:26,319 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:12:26,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939882966] [2024-11-10 19:12:26,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939882966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:12:26,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:12:26,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:12:26,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371815154] [2024-11-10 19:12:26,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:12:26,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:12:26,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:26,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:12:26,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:12:26,321 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:12:26,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:26,367 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2024-11-10 19:12:26,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:12:26,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-11-10 19:12:26,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:26,369 INFO L225 Difference]: With dead ends: 160 [2024-11-10 19:12:26,369 INFO L226 Difference]: Without dead ends: 159 [2024-11-10 19:12:26,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:12:26,369 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 35 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:26,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 197 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:12:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-10 19:12:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 123. [2024-11-10 19:12:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 80 states have (on average 1.4625) internal successors, (117), 115 states have internal predecessors, (117), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:12:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2024-11-10 19:12:26,374 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 44 [2024-11-10 19:12:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:26,374 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2024-11-10 19:12:26,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:12:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2024-11-10 19:12:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 19:12:26,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:26,375 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:12:26,387 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-11-10 19:12:26,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:26,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:26,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:26,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1092529057, now seen corresponding path program 1 times [2024-11-10 19:12:26,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:26,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330395547] [2024-11-10 19:12:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:26,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:12:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:12:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:12:26,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:26,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330395547] [2024-11-10 19:12:26,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330395547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:12:26,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644997790] [2024-11-10 19:12:26,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:26,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:26,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:12:26,743 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:12:26,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 19:12:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:26,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:12:26,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:12:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 19:12:26,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:12:27,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644997790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:12:27,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:12:27,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-10 19:12:27,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679987622] [2024-11-10 19:12:27,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:12:27,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 19:12:27,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:27,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 19:12:27,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-10 19:12:27,172 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-10 19:12:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:27,390 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2024-11-10 19:12:27,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 19:12:27,390 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 45 [2024-11-10 19:12:27,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:27,391 INFO L225 Difference]: With dead ends: 160 [2024-11-10 19:12:27,391 INFO L226 Difference]: Without dead ends: 159 [2024-11-10 19:12:27,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-11-10 19:12:27,392 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 346 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:27,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 518 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:12:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-10 19:12:27,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 124. [2024-11-10 19:12:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 116 states have internal predecessors, (118), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:12:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2024-11-10 19:12:27,397 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 45 [2024-11-10 19:12:27,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:27,397 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2024-11-10 19:12:27,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-10 19:12:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2024-11-10 19:12:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 19:12:27,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:27,398 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:12:27,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 19:12:27,603 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,SelfDestructingSolverStorable9 [2024-11-10 19:12:27,604 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:27,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:27,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1948401731, now seen corresponding path program 1 times [2024-11-10 19:12:27,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:27,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356870107] [2024-11-10 19:12:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:12:27,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181019164] [2024-11-10 19:12:27,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:27,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:27,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:12:27,615 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:12:27,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 19:12:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:27,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 19:12:27,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:12:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 19:12:27,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:12:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 19:12:27,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:27,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356870107] [2024-11-10 19:12:27,899 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:12:27,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181019164] [2024-11-10 19:12:27,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181019164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:12:27,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:12:27,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 19:12:27,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511295166] [2024-11-10 19:12:27,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:12:27,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 19:12:27,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:27,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 19:12:27,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:12:27,901 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 19:12:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:29,054 INFO L93 Difference]: Finished difference Result 206 states and 230 transitions. [2024-11-10 19:12:29,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:12:29,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 47 [2024-11-10 19:12:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:29,056 INFO L225 Difference]: With dead ends: 206 [2024-11-10 19:12:29,056 INFO L226 Difference]: Without dead ends: 191 [2024-11-10 19:12:29,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:12:29,056 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 176 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:29,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 273 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 19:12:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-10 19:12:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 173. [2024-11-10 19:12:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 138 states have (on average 1.3985507246376812) internal successors, (193), 164 states have internal predecessors, (193), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:12:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 205 transitions. [2024-11-10 19:12:29,065 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 205 transitions. Word has length 47 [2024-11-10 19:12:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:29,065 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 205 transitions. [2024-11-10 19:12:29,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 19:12:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 205 transitions. [2024-11-10 19:12:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 19:12:29,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:29,068 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:12:29,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 19:12:29,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:29,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:29,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash 191679259, now seen corresponding path program 1 times [2024-11-10 19:12:29,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:29,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455908431] [2024-11-10 19:12:29,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:29,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:12:29,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [884838036] [2024-11-10 19:12:29,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:29,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:29,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:12:29,287 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:12:29,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 19:12:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:29,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 19:12:29,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:12:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:29,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:12:29,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:29,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455908431] [2024-11-10 19:12:29,334 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:12:29,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884838036] [2024-11-10 19:12:29,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884838036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:12:29,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:12:29,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:12:29,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060758095] [2024-11-10 19:12:29,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:12:29,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:12:29,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:29,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:12:29,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:12:29,336 INFO L87 Difference]: Start difference. First operand 173 states and 205 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:12:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:29,423 INFO L93 Difference]: Finished difference Result 297 states and 361 transitions. [2024-11-10 19:12:29,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:12:29,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2024-11-10 19:12:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:29,424 INFO L225 Difference]: With dead ends: 297 [2024-11-10 19:12:29,425 INFO L226 Difference]: Without dead ends: 268 [2024-11-10 19:12:29,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:12:29,426 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 48 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:29,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 147 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:12:29,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-10 19:12:29,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2024-11-10 19:12:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 221 states have (on average 1.3529411764705883) internal successors, (299), 247 states have internal predecessors, (299), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:12:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 315 transitions. [2024-11-10 19:12:29,437 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 315 transitions. Word has length 49 [2024-11-10 19:12:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:29,438 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 315 transitions. [2024-11-10 19:12:29,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:12:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 315 transitions. [2024-11-10 19:12:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 19:12:29,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:29,440 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:12:29,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 19:12:29,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:29,640 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:29,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:29,641 INFO L85 PathProgramCache]: Analyzing trace with hash 33624038, now seen corresponding path program 1 times [2024-11-10 19:12:29,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:29,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568793475] [2024-11-10 19:12:29,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:29,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:29,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:29,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:29,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:12:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:29,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:12:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:29,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 19:12:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:29,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:29,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568793475] [2024-11-10 19:12:29,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568793475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:12:29,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:12:29,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:12:29,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929645201] [2024-11-10 19:12:29,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:12:29,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:12:29,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:29,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:12:29,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:12:29,723 INFO L87 Difference]: Start difference. First operand 258 states and 315 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:12:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:29,827 INFO L93 Difference]: Finished difference Result 269 states and 318 transitions. [2024-11-10 19:12:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:12:29,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-10 19:12:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:29,828 INFO L225 Difference]: With dead ends: 269 [2024-11-10 19:12:29,829 INFO L226 Difference]: Without dead ends: 268 [2024-11-10 19:12:29,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:12:29,830 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 35 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:29,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 195 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:12:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-10 19:12:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2024-11-10 19:12:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 221 states have (on average 1.3438914027149322) internal successors, (297), 247 states have internal predecessors, (297), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:12:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 313 transitions. [2024-11-10 19:12:29,841 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 313 transitions. Word has length 67 [2024-11-10 19:12:29,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:29,841 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 313 transitions. [2024-11-10 19:12:29,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:12:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 313 transitions. [2024-11-10 19:12:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 19:12:29,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:29,843 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:12:29,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 19:12:29,843 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:29,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash 33624079, now seen corresponding path program 1 times [2024-11-10 19:12:29,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:29,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415576103] [2024-11-10 19:12:29,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:29,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:29,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:29,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:12:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:29,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:12:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:29,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 19:12:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:29,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:29,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415576103] [2024-11-10 19:12:29,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415576103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:12:29,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:12:29,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:12:29,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029597106] [2024-11-10 19:12:29,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:12:29,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:12:29,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:29,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:12:29,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:12:29,915 INFO L87 Difference]: Start difference. First operand 258 states and 313 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:12:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:30,009 INFO L93 Difference]: Finished difference Result 258 states and 313 transitions. [2024-11-10 19:12:30,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:12:30,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-10 19:12:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:30,012 INFO L225 Difference]: With dead ends: 258 [2024-11-10 19:12:30,012 INFO L226 Difference]: Without dead ends: 257 [2024-11-10 19:12:30,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:12:30,013 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 110 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:30,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 189 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:12:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-10 19:12:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2024-11-10 19:12:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.3257918552036199) internal successors, (293), 246 states have internal predecessors, (293), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:12:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 309 transitions. [2024-11-10 19:12:30,020 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 309 transitions. Word has length 67 [2024-11-10 19:12:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:30,021 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 309 transitions. [2024-11-10 19:12:30,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:12:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 309 transitions. [2024-11-10 19:12:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 19:12:30,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:30,021 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:12:30,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 19:12:30,022 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:30,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1042345190, now seen corresponding path program 1 times [2024-11-10 19:12:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:30,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214882909] [2024-11-10 19:12:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:12:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:12:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 19:12:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:30,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214882909] [2024-11-10 19:12:30,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214882909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:12:30,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:12:30,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:12:30,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32851729] [2024-11-10 19:12:30,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:12:30,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:12:30,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:30,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:12:30,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:12:30,094 INFO L87 Difference]: Start difference. First operand 257 states and 309 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:12:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:30,255 INFO L93 Difference]: Finished difference Result 263 states and 312 transitions. [2024-11-10 19:12:30,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:12:30,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-10 19:12:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:30,257 INFO L225 Difference]: With dead ends: 263 [2024-11-10 19:12:30,257 INFO L226 Difference]: Without dead ends: 262 [2024-11-10 19:12:30,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:12:30,258 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 179 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:30,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 151 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:12:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-10 19:12:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 257. [2024-11-10 19:12:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.3167420814479638) internal successors, (291), 246 states have internal predecessors, (291), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:12:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 307 transitions. [2024-11-10 19:12:30,271 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 307 transitions. Word has length 68 [2024-11-10 19:12:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:30,271 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 307 transitions. [2024-11-10 19:12:30,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:12:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 307 transitions. [2024-11-10 19:12:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 19:12:30,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:30,273 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:12:30,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 19:12:30,273 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:30,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1042346471, now seen corresponding path program 1 times [2024-11-10 19:12:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:30,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666058881] [2024-11-10 19:12:30,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:30,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:12:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:12:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 19:12:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:30,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:30,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666058881] [2024-11-10 19:12:30,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666058881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:12:30,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:12:30,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:12:30,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602318855] [2024-11-10 19:12:30,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:12:30,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:12:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:30,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:12:30,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:12:30,332 INFO L87 Difference]: Start difference. First operand 257 states and 307 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:12:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:30,420 INFO L93 Difference]: Finished difference Result 269 states and 319 transitions. [2024-11-10 19:12:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:12:30,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-10 19:12:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:30,422 INFO L225 Difference]: With dead ends: 269 [2024-11-10 19:12:30,422 INFO L226 Difference]: Without dead ends: 268 [2024-11-10 19:12:30,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:12:30,422 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 56 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:30,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 182 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:12:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-10 19:12:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256. [2024-11-10 19:12:30,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 221 states have (on average 1.2986425339366516) internal successors, (287), 245 states have internal predecessors, (287), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:12:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 303 transitions. [2024-11-10 19:12:30,430 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 303 transitions. Word has length 68 [2024-11-10 19:12:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:30,430 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 303 transitions. [2024-11-10 19:12:30,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:12:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 303 transitions. [2024-11-10 19:12:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 19:12:30,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:30,431 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:12:30,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 19:12:30,431 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:30,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash -583895041, now seen corresponding path program 1 times [2024-11-10 19:12:30,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:30,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607081745] [2024-11-10 19:12:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:30,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:12:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:12:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 19:12:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:30,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:30,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607081745] [2024-11-10 19:12:30,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607081745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:12:30,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271841417] [2024-11-10 19:12:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:30,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:30,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:12:30,517 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:12:30,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 19:12:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:30,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:12:30,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:12:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:30,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:12:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:30,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271841417] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:12:30,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:12:30,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-10 19:12:30,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69761701] [2024-11-10 19:12:30,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:12:30,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:12:30,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:30,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:12:30,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:12:30,795 INFO L87 Difference]: Start difference. First operand 256 states and 303 transitions. Second operand has 14 states, 13 states have (on average 10.923076923076923) internal successors, (142), 14 states have internal predecessors, (142), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-10 19:12:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:31,278 INFO L93 Difference]: Finished difference Result 332 states and 401 transitions. [2024-11-10 19:12:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 19:12:31,279 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 10.923076923076923) internal successors, (142), 14 states have internal predecessors, (142), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 75 [2024-11-10 19:12:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:31,280 INFO L225 Difference]: With dead ends: 332 [2024-11-10 19:12:31,280 INFO L226 Difference]: Without dead ends: 330 [2024-11-10 19:12:31,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2024-11-10 19:12:31,281 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 384 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:31,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 380 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:12:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-10 19:12:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 271. [2024-11-10 19:12:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 236 states have (on average 1.2838983050847457) internal successors, (303), 260 states have internal predecessors, (303), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:12:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 319 transitions. [2024-11-10 19:12:31,296 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 319 transitions. Word has length 75 [2024-11-10 19:12:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:31,297 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 319 transitions. [2024-11-10 19:12:31,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 10.923076923076923) internal successors, (142), 14 states have internal predecessors, (142), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-10 19:12:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 319 transitions. [2024-11-10 19:12:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 19:12:31,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:31,297 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:12:31,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-10 19:12:31,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 19:12:31,498 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:31,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:31,500 INFO L85 PathProgramCache]: Analyzing trace with hash -845922978, now seen corresponding path program 1 times [2024-11-10 19:12:31,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:31,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947377777] [2024-11-10 19:12:31,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:31,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:31,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:31,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:31,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:12:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:31,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:12:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:31,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 19:12:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:31,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:31,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947377777] [2024-11-10 19:12:31,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947377777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:12:31,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:12:31,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:12:31,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890805727] [2024-11-10 19:12:31,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:12:31,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:12:31,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:31,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:12:31,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:12:31,564 INFO L87 Difference]: Start difference. First operand 271 states and 319 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:12:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:12:31,670 INFO L93 Difference]: Finished difference Result 273 states and 323 transitions. [2024-11-10 19:12:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:12:31,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2024-11-10 19:12:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:12:31,671 INFO L225 Difference]: With dead ends: 273 [2024-11-10 19:12:31,671 INFO L226 Difference]: Without dead ends: 272 [2024-11-10 19:12:31,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:12:31,672 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 66 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:12:31,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 185 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:12:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-10 19:12:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 267. [2024-11-10 19:12:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 233 states have (on average 1.2703862660944205) internal successors, (296), 256 states have internal predecessors, (296), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:12:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 312 transitions. [2024-11-10 19:12:31,682 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 312 transitions. Word has length 75 [2024-11-10 19:12:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:12:31,682 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 312 transitions. [2024-11-10 19:12:31,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 19:12:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 312 transitions. [2024-11-10 19:12:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 19:12:31,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:12:31,683 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:12:31,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 19:12:31,684 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-11-10 19:12:31,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:12:31,684 INFO L85 PathProgramCache]: Analyzing trace with hash -920877024, now seen corresponding path program 1 times [2024-11-10 19:12:31,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:12:31,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090431955] [2024-11-10 19:12:31,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:31,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:12:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:31,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:12:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:31,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:12:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:31,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 19:12:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:31,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:12:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:31,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 19:12:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:31,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:12:31,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090431955] [2024-11-10 19:12:31,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090431955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:12:31,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415215516] [2024-11-10 19:12:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:12:31,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:12:31,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:12:31,762 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:12:31,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 19:12:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:12:31,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:12:31,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:12:49,940 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_48| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_48| |v_ULTIMATE.start_main_~R~0#1_48|))) (and (<= .cse0 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0)))) is different from true [2024-11-10 19:12:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 4 not checked. [2024-11-10 19:12:49,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:12:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:12:50,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415215516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:12:50,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:12:50,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-10 19:12:50,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899376243] [2024-11-10 19:12:50,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:12:50,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:12:50,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:12:50,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:12:50,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=106, Unknown=6, NotChecked=22, Total=182 [2024-11-10 19:12:50,089 INFO L87 Difference]: Start difference. First operand 267 states and 312 transitions. Second operand has 14 states, 13 states have (on average 10.23076923076923) internal successors, (133), 14 states have internal predecessors, (133), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-10 19:12:59,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:08,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:12,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:16,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:18,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:22,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:23,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:24,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:25,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:29,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:31,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:35,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:36,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:40,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:44,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:45,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:49,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:53,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:13:58,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:14:02,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:14:03,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:14:04,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:14:05,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:14:06,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]